The SAT solving method as applied to cryptographic analysis of asymmetric ciphers

Details The SAT solving method as applied to cryptographic analysis of asymmetric ciphers The SAT solving method as applied to cryptographic analysis of asymmetric ciphers

2009-07-10

arxiv.org/abs/0907.1755v1

Computer Science

Cryptography and Security

10 pages, 3 figures

Scientific paper

The one of the most interesting problem of discrete mathematics is the SAT (satisfiability) problem. Good way in SAT solver developing is to transform the SAT problem to the problem of continuous search of global minimums of the functional associated with the CNF. This article proves the special construction of the functional and offers to solve the system of non-linear algebraic equation that determines functional stationary points via modified method of consecutive approximation. The article describes parallel versions of the method. Also gives the schema of using the method to important problems of cryptographic analysis of asymmetric ciphers, including determining concrete bits of multipliers (in binary form) in large factorization problems and concrete bits of exponent of discrete logarithm problem.

Affiliated with

Also associated with

No associations

Rating

The SAT solving method as applied to cryptographic analysis of asymmetric ciphers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The SAT solving method as applied to cryptographic analysis of asymmetric ciphers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The SAT solving method as applied to cryptographic analysis of asymmetric ciphers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-164378