Juan Garay

Arjen K. Lenstra

Masahiro Mambo

Rene Peralta

This book constitutes the refereed proceedings of the 10th International Conference on Information Security Conference, ISC 2007. Coverage in the 28 revised full papers presented includes intrusion detection, digital rights management, symmetric-key cryptography, cryptographic protocols and schemes, identity-based schemes, cryptanalysis, DoS protection, software obfuscation, public-key cryptosystems, elliptic curves and applications and security issues in databases.

10th International Conference, ISC 2007, Valparaiso, Chile, October 9-12, 2007, Proceedings

Information Security

Hendrik W.Jr. Lenstra

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. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.

The Development of the Number Field Sieve

This book constitutes the refereed proceedings of the 10th International Conference on Information Security Conference, ISC 2007, held in Valparaiso, Chile, October 9-12, 2007.The 28 revised full papers presented were carefully reviewed and selected from 116 submissions. The topics include Intrusion Detection, Digital Rights Management, Symmetric-Key Cryptography, Cryptographic Protocols and Schemes, Identity-Based Schemes, Cryptanalysis, DoS Protection, Software Obfuscation, Public-Key Cryptosystems, Elliptic Curves and Applications and Security Issues in Databases.

Arjen K. Lenstra

About

Books

Join the club