<--- 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 | Lattice Cryptography: A White Paper Daniele Micciancio∗ March 16, 2010 1DocID: 1pUoS - View Document |
 | Guidelines for managing the endangered Growling Grass Frog in urbanising landscapes Geoffrey Heard, Michael Scroggie and Nick Clemann 2010DocID: 1lADF - View Document |
 | SWIFFT: A Modest Proposal for FFT Hashing Vadim Lyubashevsky1, Daniele Micciancio1 , Chris Peikert2, , and Alon Rosen3 1 University of California at San DiegoDocID: 1lyrp - View Document |
 | Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008DocID: 14vOf - View Document |
 | Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006 Donghoon Chang Center for Information Security Technologies(CIST), Korea University, KoreaDocID: 12NLC - View Document |