Keywords
CryptosystemCryptanalysisDiscrete mathematicsLattice problemCryptographyComputational complexity theoryComputer scienceMathematicsTheoretical computer scienceArithmeticAlgorithm
Affiliated Institutions
Related Publications
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning...
Cryptanalysis of the Chor-Rivest cryptosystem
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before being all broken, all but the Chor-Rivest cryptosystem. We show how to break t...
Improved cryptographic hash functions with worst-case/average-case connection
(MATH) We define a new family of collision resistant hash functions whose security is based on the worst case hardness of approximating the covering radius of a lattice within a...
Free energy minimisation algorithmfor decoding and cryptanalysis
An algorithm is derived for inferring a binary vector s given noisy observations of As modulo 2, where A is a binary matrix. The binary vector is replaced by a vector of probabi...
Publication Info
- Year
- 1998
- Type
- book-chapter
- Pages
- 223-242
- Citations
- 52
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
52
OpenAlex
Cite This
P.H. Nguyen,
Jacques Stern
(1998).
Cryptanalysis of the Ajtai-Dwork cryptosystem.
Lecture notes in computer science
, 223-242.
https://doi.org/10.1007/bfb0055731
Identifiers
- DOI
- 10.1007/bfb0055731