scientific article; zbMATH DE number 1302849

MaRDI QIDQ4249332zbMATH OpenFDO

Authors Phong Q. Nguyen, Jacques Stern

Publication date 5 May 2002

zbMATH Keywords

NP-hardnessclosest vector problemlattice problemsshortest vector problemAjtai-Dwork cryptosystemheuristic attack

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A lattice-based public-key cryptosystem
• scientific article; zbMATH DE number 1304121
• scientific article; zbMATH DE number 6292594
• Representing hard lattices with \(O(n\log n)\) bits (extended abstract)

Cited in

(10)

• Theory of Cryptography
• Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
• Improved cryptanalysis of the AJPS Mersenne based cryptosystem
• Cryptographic functions from worst-case complexity assumptions
• A public-key encryption scheme based on non-linear indeterminate equations
• A thirty year old conjecture about promise problems
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Multi-bit Cryptosystems Based on Lattice Problems
• A polynomial-time algorithm for solving the hidden subset sum problem
• Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249332)