Sciweavers

25 search results - page 5 / 5
» Multi-bit Cryptosystems Based on Lattice Problems
Sort
View
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
12 years 9 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
FOCS
2006
IEEE
13 years 12 months ago
Cryptographic Hardness for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
Adam R. Klivans, Alexander A. Sherstov
ASIACRYPT
2005
Springer
13 years 11 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
ECCC
2007
123views more  ECCC 2007»
13 years 5 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
ASAP
2008
IEEE
182views Hardware» more  ASAP 2008»
14 years 11 days ago
Low-cost implementations of NTRU for pervasive security
NTRU is a public-key cryptosystem based on the shortest vector problem in a lattice which is an alternative to RSA and ECC. This work presents a compact and low power NTRU design ...
Ali Can Atici, Lejla Batina, Junfeng Fan, Ingrid V...