How to fake an RSA signature by encoding modular root finding as a SAT problem
From MaRDI portal
Publication:1408375
DOI10.1016/S0166-218X(02)00400-6zbMath1029.68053OpenAlexW2060310671MaRDI QIDQ1408375
Fabio Massacci, Claudia Fiorini, Enrico Martinelli
Publication date: 15 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00400-6
RSAAutomated reasoningSatisfiabilityBenchmarksLogical cryptanalysisModular cube rootsModular multiplication
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-phase algorithm for solving a class of hard satisfiability problems
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The propositional formula checker HeerHugo
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- Logic programs with stable model semantics as a constraint programming paradigm
- Generating hard satisfiability problems
- Experimental results on the crossover point in random 3-SAT
- Some pitfalls for experimenters with random SAT
- Graph-Based Algorithms for Boolean Function Manipulation
- Solving Simultaneous Modular Equations of Low Degree
- Novel approaches to the design of VLSI RNS multipliers
- A method for obtaining digital signatures and public-key cryptosystems
- Breaking RSA may not be equivalent to factoring
- New efficient structure for a modular multiplier for RNS
- An RNS Montgomery modular multiplication algorithm
- Residue multipliers using factored decomposition
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: How to fake an RSA signature by encoding modular root finding as a SAT problem
