No label defined (Q3816017)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4087589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4087589 |
Statements
1988
0 references
cryptanalysis
0 references
integer factorization
0 references
Pollard Rho method
0 references
Hellman time- memory trade-off attack
0 references
block cipher
0 references
Morrison-Brillhart factorization method
0 references
0.7674543261528015
0 references
0.7641649842262268
0 references
0.7638450860977173
0 references
[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.
0 references