A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
From MaRDI portal
Publication:5261011
DOI10.1007/978-1-4614-4109-0_13zbMATH Open1315.05024OpenAlexW228755155MaRDI QIDQ5261011FDOQ5261011
Christos Koukouvinos, Dimitris Simos
Publication date: 1 July 2015
Published in: Applications of Mathematics and Informatics in Military Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-4109-0_13
Recommendations
- Combinatorial designs and cryptography, revisited
- scientific article; zbMATH DE number 446495
- scientific article; zbMATH DE number 986432
- Theory of combinatorial designs with applications to encryption and the design of experiments
- Jordan derivations on prime rings
- scientific article; zbMATH DE number 3954809
- Combinatorial designs for authentication and secrecy codes
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 874559
- Cryptanalysis of a combinatorial public key cryptosystem
Cites Work
- Orthogonal arrays. Theory and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cryptography. Theory and practice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in cryptology -- EUROCRYPT '85. Proceedings of a Workshop on the Theory and Application of Cryptographic Techniques, Linz, Austria, April 1985
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Number theory in science and communication. With applications in cryptography, physics, biology, digital information, and computing
- A Family of Difference Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- A family of difference sets
- Title not available (Why is that?)
- Protocols for authentification and key establishment
- Title not available (Why is that?)
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- A Survey of Difference Sets
- Classification of orthogonal arrays by integer programming
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Switching Operations for Hadamard Matrices
- An infinite class of Williamson matrices
- Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hadamard's determinant theorem and the sum of four squares
- Further contributions to nonisomorphic two level orthogonal arrays
- Title not available (Why is that?)
- An infinite family of Hadamard matrices of Williamson type
- Fast Data Encipherment Algorithm FEAL
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hadamard ideals and Hadamard matrices with two circulant cores
- Title not available (Why is that?)
- Decomposition of Hadamard matrices
- On a Class of Arrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encryption schemes using orthogonal arrays
Cited In (1)
This page was built for publication: A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261011)