DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions

DOI10.1007/978-3-642-21581-0_8zbMATH Open1330.68270OpenAlexW2142477803MaRDI QIDQ3007675FDOQ3007675

A. A. Ignatiev, Aleksandr Anatol'evich Semënov

Publication date: 17 June 2011

Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_8

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Graph-Based Algorithms for Boolean Function Manipulation
• Limitations of restricted branching in clause learning
• SAT-Based Scalable Formal Verification Solutions
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Efficient data structures for backtrack search SAT solvers

Cited In (3)

• APPLICATIONS OF THE DRAZIN INVERSE TO THE HILL CRYPTOGRAPHIC SYSTEM. PART II.
• Combining incomplete search and clause generation: an application to the orienteering problems with time windows
• On a class of decision diagrams

Uses Software

• ManySAT
• MiniSat
• Chaff
• PaMiraXT
• Plingeling
• PrecoSAT
• Lingeling
• ZRes

This page was built for publication: DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions

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