The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem

DOI10.1007/978-3-030-23696-0_3zbMath1454.94055OpenAlexW2955796538MaRDI QIDQ2177615

Alessandro Budroni, Andrea Tenti

Publication date: 6 May 2020

Full work available at URL: http://hdl.handle.net/1956/21939

zbMATH Keywords

integer linear programmingpublic-key cryptographypost-quantum cryptographyMersenne-based cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

This page was built for publication: The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem