First Page | Document Content | |
---|---|---|
Date: 2012-04-04 23:26:12Cryptography Post-quantum cryptography Multivariate cryptography Finite fields Lattice-based cryptography Hidden Field Equations Learning with errors QUAD RSA Reduction Computational hardness assumption Ideal lattice cryptography | Public-Key Cryptography from New Multivariate Quadratic Assumptions Yun-Ju Huang1,3 , Feng-Hao Liu2 , and Bo-Yin Yang3 1 3Add to Reading ListSource URL: precision.moscito.orgDownload Document from Source WebsiteFile Size: 261,61 KBShare Document on Facebook |
An improved compression technique for signatures based on learning with errors Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand.DocID: 1xTLZ - View Document | |
Practical post-quantum key exchange from the Learning with Errors ProblemDocID: 1vdCU - View Document | |
Quantum computers and factoring Learning with errors Cryptography from LWE From linear algebra to post-quantum cryptographyDocID: 1uiVi - View Document | |
FrodoKEM Learning With Errors Key Encapsulation Algorithm Specifications And Supporting Documentation November 30,DocID: 1tCj6 - View Document | |
Interpolating Predicate and Functional Encryption from Learning With Errors Shweta Agrawal ∗DocID: 1taPr - View Document |