How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375)
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: How to fake an RSA signature by encoding modular root finding as a SAT problem |
scientific article; zbMATH DE number 1981503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to fake an RSA signature by encoding modular root finding as a SAT problem |
scientific article; zbMATH DE number 1981503 |
Statements
How to fake an RSA signature by encoding modular root finding as a SAT problem (English)
0 references
15 September 2003
0 references
Logical cryptanalysis
0 references
Satisfiability
0 references
RSA
0 references
Modular cube roots
0 references
Automated reasoning
0 references
Modular multiplication
0 references
Benchmarks
0 references
0 references
0.8095148801803589
0 references
0.8095148801803589
0 references
0.7945895195007324
0 references
0.7945895195007324
0 references
0.7306128144264221
0 references
