Parallel algorithms for SAT in application to inversion problems of some discrete functions

Details Parallel algorithms for SAT in application to inversion problems of some discrete functions Parallel algorithms for SAT in application to inversion problems of some discrete functions

2011-02-17

arxiv.org/abs/1102.3563v1

Computer Science

Distributed, Parallel, and Cluster Computing

16 pages, 8 figures

Scientific paper

In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model checking, hardware verification, cryptanalysis, computer biology and other domains. Quite often it is necessary to invert these functions, i.e. to find an unknown preimage if an image and algorithm of function computation are given. In general case this problem is computationally intractable. However, many of it's special cases are very important in practical applications. Thus development of algorithms that are applicable to these special cases is of importance. The practical applicability of such algorithms can be validated by their ability to solve the problems that are considered to be computationally hard (for example cryptanalysis problems). In this article we propose the technology of solving the inversion problem for polynomially computable discrete functions. This technology was implemented in distributed computing environments (parallel clusters and Grid-systems). It is based on reducing the inversion problem for the considered function to some SAT problem. We describe a general approach to coarse-grained parallelization for obtained SAT problems. Efficiency of each parallelization scheme is determined by the means of a special predictive function. The proposed technology was validated by successful solving of cryptanalysis problems for some keystream generators. The main practical result of this work is a complete cryptanalysis of keystream generator A5/1 which was performed in a Grid system specially built for this task.

Affiliated with

Also associated with

No associations

Rating

Parallel algorithms for SAT in application to inversion problems of some discrete functions 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 Parallel algorithms for SAT in application to inversion problems of some discrete functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel algorithms for SAT in application to inversion problems of some discrete functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380523