Sciweavers

111 search results - page 4 / 23
» New Public Key Cryptosystems Based on the Dependent-RSA Prob...
Sort
View
ECCC
2008
98views more  ECCC 2008»
14 years 9 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
ACISP
2001
Springer
15 years 2 months ago
Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...
Amr M. Youssef, Guang Gong
ICICS
1999
Springer
15 years 1 months ago
Reaction Attacks against several Public-Key Cryptosystems
Abstract. We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Key Cryptosystem, and variants of those systems. Most of these systems base their ...
Chris Hall, Ian Goldberg, Bruce Schneier
78
Voted
EUROCRYPT
2001
Springer
15 years 2 months ago
NSS: An NTRU Lattice-Based Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU pu...
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverma...
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
15 years 9 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev