The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem (Q2177615)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem |
scientific article |
Statements
The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem (English)
0 references
6 May 2020
0 references
post-quantum cryptography
0 references
public-key cryptography
0 references
integer linear programming
0 references
Mersenne-based cryptosystem
0 references
0.80899644
0 references
0.79391366
0 references
0.79307234
0 references
0 references
0.7836808
0 references
0 references
