scientific article; zbMATH DE number 4087589

From MaRDI portal
Publication:3816017





[For the entire collection see Zbl 0655.00007.] We explore some methods used in cryptanalysis, particularly integer factorization techniques. Two algorithms for integer factorization are related to algorithms for other cryptanalytic problems, and these relationships are highlighted. The Pollard Rho method for factoring is based on a ``persistent coincidence, an idea which again surfaces in the Hellman time-memory trade-off attack on a block cipher. The Morrison-Brillhart factorization method, based on ``smooth numbers, gives rise to discrete logarithm algorithms using the same techniques. We present these methods and highlight their interrelationships.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3816017)