Sciweavers

Share
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
7 years 10 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert
ASIACRYPT
2000
Springer
8 years 11 months ago
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
Anand Desai, Sara K. Miner
IMA
2005
Springer
71views Cryptology» more  IMA 2005»
9 years 25 days ago
Concrete Security of the Blum-Blum-Shub Pseudorandom Generator
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
Andrey Sidorenko, Berry Schoenmakers
books