i& Page 1 i& Designs, Codes and Cryptography, 19, 101-128 (2000) •"'Il © 2000 Kluwer
Academic Publishers, Boston. Integer Factoring ARJEN K. LENSTRA arjen.lenstra@citicorp.com …

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …

The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

Recent progress on NFS imposed a new estimation of the security of pairings. In this work
we study the best attacks against some of the most popular pairings and propose new key …

This paper introduces a new efficient algorithm for computing Gröbner bases. To avoid as
much intermediate computation as possible, the algorithm computes successive truncated …

An Introduction to Cryptography | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover An …

The integer factorisation and discrete logarithm problems are of practical importance
because of the widespread use of public key cryptosystems whose security depends on the …

The number field sieve is an algorithm to factor integers of the form r, 4-s for small positive r
and s. This note is intended as a'report on work in progress' on this algorithm. We informally …

This monograph describes the theory behind Raptor codes, and elucidates elements of the
processes behind the design of two of the most prominent members of this class of codes …

В статье рассмотрены некоторые элементы теории чисел и показано, как они
используются в современной криптографии. В качестве примеров выбраны наиболее …