Сведение задач факторизации, дискретного логарифмирования и логарифмирования на эллиптической кривой к решению ассоциированных задач "выполнимость"
Дулькейт Владимир Игоревич · CyberLeninK (CyberLeninka) · 2010
The algorithms of conservative reduction of factorization, discreet logarithm and elliptic curve logarithm problems to satisfiability problem (SAT) were proposed. The capabilities of modern SAT-solvers for solving produced SAT instances were investigated. The resistance to whole key repairing by its fragments was investigated for considered problems.
Cited by 0 works.