Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

(newbie here) I try to analyze amateur cryptosystem and wondering, if it's possible to reduce it as reduce a very long boolean expression? What tool can I try to use?

share|improve this question

closed as not a real question by Paŭlo Ebermann May 16 '12 at 22:38

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

That's probably what I need en.wikipedia.org/wiki/Circuit_minimization –  Dennis Yurichev May 15 '12 at 5:18
I just want to know, if it's reducible, because if it would be possible to reduce it significally, that would be a very optimistic sign. Is impossibility of reducibility is a measure of good cryptosystem? –  Dennis Yurichev May 15 '12 at 5:47
Sorry, it is not really clear what you are asking. Do you search a tool for reducing boolean expressions? Do you search a solver? (See our algebraic-attack tag for some questions about this.) Feel free to edit this question to be more clear, and then flag is for moderator attention, and we can reopen it. –  Paŭlo Ebermann May 16 '12 at 22:50
add comment

1 Answer 1

A known plaintext attack on a cryptosystem can often be expressed in the formalism of boolean satisfiability, then if the cryptosystem is weak solved using a solver program such as these ones.

share|improve this answer
add comment

Not the answer you're looking for? Browse other questions tagged or ask your own question.