Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment

DOI10.1016/j.tcs.2006.07.060zbMath1149.94012OpenAlexW1982006398WikidataQ122681311 ScholiaQ122681311MaRDI QIDQ857394

Tal Mor, Oleg Izmerly

Publication date: 14 December 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.060

zbMATH Keywords

post-quantum cryptographypublic key encryptionchosen ciphertext attackquantum environmentunique shortest vector problem (u-SVP)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• McEliece

Cites Work

• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
• New lattice based cryptographic constructions
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Nonmalleable Cryptography
• Hiding information and signatures in trapdoor knapsacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment