<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2018-06-14 07:12:40Mathematics Algebra Cryptography Post-quantum cryptography Polynomials Lattice-based cryptography Coding theory SWIFFT BCH code Polynomial ring Learning with errors Binomial coefficient |
Add to Reading List |
SPRING: Fast Pseudorandom Functions from Rounded Ring Products Abhishek Banerjee1? , Hai Brenner2?? , Ga¨etan Leurent3 , Chris Peikert1? ? ? , and Alon Rosen2† 1 | 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 |