How to fake an RSA signature by encoding modular root finding as a SAT problem

DOI10.1016/S0166-218X(02)00400-6zbMATH Open1029.68053OpenAlexW2060310671MaRDI QIDQ1408375FDOQ1408375

Authors: Claudia Fiorini, Enrico Martinelli, Fabio Massacci 

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

Recommendations

• Logical cryptanalysis as a SAT problem
• Which new RSA-signatures can be computed from certain given RSA- signatures!
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• SAT-approach to cryptography of some stream ciphering systems
• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages

zbMATH Keywords

RSABenchmarksSatisfiabilityAutomated reasoningLogical cryptanalysisModular cube rootsModular multiplication

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• A method for obtaining digital signatures and public-key cryptosystems
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Breaking RSA may not be equivalent to factoring
• Logic programs with stable model semantics as a constraint programming paradigm
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Novel approaches to the design of VLSI RNS multipliers
• New efficient structure for a modular multiplier for RNS
• Experimental results on the crossover point in random 3-SAT
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating hard satisfiability problems
• An RNS Montgomery modular multiplication algorithm
• A two-phase algorithm for solving a class of hard satisfiability problems
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Some pitfalls for experimenters with random SAT
• The propositional formula checker HeerHugo
• Title not available (Why is that?)
• Solving Simultaneous Modular Equations of Low Degree
• Residue multipliers using factored decomposition

Cited In (2)

• A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard

Uses Software

• Smodels
• HeerHugo

This page was built for publication: How to fake an RSA signature by encoding modular root finding as a SAT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408375)