Modification and Optimization of Pollards's Factorization \rho-Method by Means of Recursive Algorithm of Number Calculation Factorization

Investigations of cryptographic algorithms for today are very actually in connection with cybernetic attacks threat and necessity of information protection at the enterprises of various levels including the strategic appointment. The project implementation of John Pollard's factorization ρ-meth...

Full description

Saved in:
Bibliographic Details
Published in2019 IEEE East-West Design & Test Symposium (EWDTS) pp. 1 - 6
Main Authors Smirnov, Ivan A., Razumov, Pavel V., Boldyrikhin, Nickolay V., Cherckesova, Larissa V., Revyakina, Yelena A., Porksheyan, Vitaliy M., Safaryan, Olga A., Lobodenko, Andrey G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2019
Subjects
adjacency matrix
algorithmic complexity
Complexity theory
Computer security
Cryptography
Euclid
factorization algorithm
Information systems
McCabe metrics
Pollard
reachability matrix
Software algorithms
Task analysis
Online AccessGet full text

Cover

More Information
Summary:Investigations of cryptographic algorithms for today are very actually in connection with cybernetic attacks threat and necessity of information protection at the enterprises of various levels including the strategic appointment. The project implementation of John Pollard's factorization ρ-method in the programming language C++ is presented, which works faster than the standard algorithm by 27%. It can facilitate greatly the deciphering operation and cryptographic analysis of various ciphers such as RSA cipher.
ISSN:2472-761X
DOI:10.1109/EWDTS.2019.8884461