How to fake an RSA signature by encoding modular root finding as a SAT problem.
Claudia FioriniEnrico MartinelliFabio MassacciPublished in: Discret. Appl. Math. (2003)
Keyphrases
- sat problem
- signature scheme
- digital signature
- sat solvers
- boolean satisfiability
- phase transition
- max sat
- np complete
- sat solving
- satisfiability problem
- learning algorithm
- randomly generated
- public key
- constraint satisfaction problems
- sat instances
- elliptic curve
- probability distribution
- search space
- genetic algorithm
- weighted max sat