Asymmetric cryptography with S-Boxes Is it easier than expected to design efficient asymmetric cryptosystems?
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 369-380
- https://doi.org/10.1007/bfb0028492
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Chosen Plaintext Attack of the 16-round Khufu CryptosystemPublished by Springer Nature ,2001
- Differential Cryptanalysis of the Full 16-round DESPublished by Springer Nature ,2001
- Analysis of a Public Key Approach Based on Polynomial SubstitutionPublished by Springer Nature ,2000
- How to Protect DES Against Exhaustive Key SearchPublished by Springer Nature ,1996
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric AlgorithmsPublished by Springer Nature ,1996
- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88Published by Springer Nature ,1995
- Functional decomposition of polynomials: The wild caseJournal of Symbolic Computation, 1990
- Functional decomposition ofpolynomials: the tame caseJournal of Symbolic Computation, 1990
- The inverse of an automorphism in polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-EncryptionPublished by Springer Nature ,1988