Global optimization problems associated with cryptographic analysis of asymmetric ciphers

Abstract: The aim of this article is to establish relation between well-known problems of cryptographic analysis and global optimization problems which can be associated with SAT representation of cryptographic algorithms where bits of key is part of SAT solution string. There was constructions SAT forms for factorization problem, SAT forms for logarithmic problem and logarithmic problem on elliptic curves. For numerical solution was adapted some low relaxation algorithms and for example results of numeri cal experiments give to us strong more then 50% bits for un- knowns in SAT factorization form.