Integer Reconstruction Public-Key Encryption

DOI10.1007/978-3-030-31578-8_23zbMath1457.94128OpenAlexW2979670944MaRDI QIDQ3297634

Houda Ferradi, David Naccache

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31578-8_23

zbMATH Keywords

implementationefficiency improvementKEMMERS assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• A new public-key cryptosystem via Mersenne numbers
• Factoring polynomials with rational coefficients
• Attacks on the AJPS Mersenne based cryptosystem
• On the hardness of the Mersenne Low Hamming Ratio assumption
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• On Ideal Lattices and Learning with Errors over Rings
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Lattice-Based Cryptography

This page was built for publication: Integer Reconstruction Public-Key Encryption