A compact QUBO encoding derived via ILP reduces logical variables by thousands in AES, MD5, SHA1 and SHA256, with over 8x reduction for AES-256.
Dasgupta, The Hardness of K-means Clustering, Techni cal re- port (University of California, San Diego
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions
A compact QUBO encoding derived via ILP reduces logical variables by thousands in AES, MD5, SHA1 and SHA256, with over 8x reduction for AES-256.