Factorization using binary decision diagrams

DOI10.1007/S12095-018-0304-7MaRDI QIDQ2632840zbMATH OpenOpenAlexWikidataFDO

Authors Håvard Raddum, Srimathi Varadharajan

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

zbMATH Keywords

RSAinteger factorizationbinary decision diagrams

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

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

Cites work

• scientific article; zbMATH DE number 3959521 (Why is no real title available?)
• scientific article; zbMATH DE number 1258344 (Why is no real title available?)
• Algebraic attacks using binary decision diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• Improving the variable ordering of OBDDs is NP-complete
• Solving compressed right hand side equation systems with linear absorption
• 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)