Factorization using binary decision diagrams

DOI10.1007/S12095-018-0304-7zbMATH Open1412.94201OpenAlexW2802821745WikidataQ129920242 ScholiaQ129920242MaRDI QIDQ2632840FDOQ2632840

Srimathi Varadharajan, Håvard Raddum

Publication date: 15 May 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0304-7

Recommendations

• Integer multiplication and the complexity of binary decision diagrams
• BDDs -- design, analysis, complexity, and applications.
• Binary decision diagrams
• A note on the size of OBDDs for the graph of integer multiplication
• On the OBDD complexity of the most significant bit of integer multiplication

zbMATH Keywords

RSAinteger factorizationbinary decision diagrams

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• Solving Compressed Right Hand Side Equation Systems with Linear Absorption
• Algebraic Attacks Using Binary Decision Diagrams
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improving the variable ordering of OBDDs is NP-complete
• πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space

Cited In (1)

• Representing the integer factorization problem using ordered binary decision diagrams

This page was built for publication: Factorization using binary decision diagrams

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