Development of the Number Field Sieve

Development of the Number Field Sieve
Автор
 
Год
 
Страниц
 
141
Искать в интернет библиотекахКупить

Описание:

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollards original manuscript is included. In addition, there is an annotated bibliography of directly related literature.

Похожие книги

The LLL Algorithm: Survey and Applications (Information Security and Cryptography)The LLL Algorithm: Survey and Applications (Information Security and Cryptography)
Автор: Phong Q. Nguyen, Brigitte Vallée
Год: 2009
Kalman filtering and neural networksKalman filtering and neural networks
Автор: Simon Haykin
Год: 2001
Jordan canonical form: Theory and practiceJordan canonical form: Theory and practice
Автор: Weintraub S.
Год: 2009
PERFORMANCE AMELIORATION OF GENETIC ALGORITHMPERFORMANCE AMELIORATION OF GENETIC ALGORITHM
Автор: Siva Sathya Sundaram
Год: 2010