On the hardness of the Mersenne Low Hamming Ratio assumption

DOI10.1007/978-3-030-25283-0_9zbMath1454.94050OpenAlexW2949793526MaRDI QIDQ2303103

Rémi Géraud, Marc Beunardeau, Aisling Connolly, David Naccache

Publication date: 2 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25283-0_9

zbMATH Keywords

Mersenne primespublic-key cryptosystemAJPS cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Integer Reconstruction Public-Key Encryption ⋮ A framework for cryptographic problems from linear algebra ⋮ Integer Version of Ring-LWE and Its Applications ⋮ A note on Vietoris' number sequence

This page was built for publication: On the hardness of the Mersenne Low Hamming Ratio assumption