Public-Key Cryptography and Computational Number Theory

✍ Scribed by Ed. by Kazimierz Alster, Jerzy Urbanowicz, Hugh C. Williams

• Publisher: Walter de Gruyter
• Year: 2001
• Tongue: English
• Leaves: 345
• Category: Library

✦ Synopsis

The Proceedings contain twenty selected, refereed contributions arising from the International Conference on Public-Key Cryptography and Computational Number Theory held in Warsaw, Poland, on September 11-15, 2000.
The conference, attended by eightyfive mathematicians from eleven countries, was organized by the Stefan Banach International Mathematical Center.
This volume contains articles from leading experts in the world on cryptography and computational number theory, providing an account of the state of research in a wide variety of topics related to the conference theme. It is dedicated to the memory of the Polish mathematicians Marian Rejewski (1905-1980), Jerzy Róøycki (1909-1942) and Henryk Zygalski (1907-1978), who deciphered the military version of the famous Enigma in December 1932 ? January 1933. A noteworthy feature of the volume is a foreword written by Andrew Odlyzko on the progress in cryptography from Enigma time until now.

✦ Table of Contents

Frontmatter
Pages I-VI

Preface
Pages VII-VIII

Mathematics, cryptology, and technology
Odlyzko, Andrew
Pages IX-X

Table of contents
Pages XI-XII

A survey on IQ cryptography
Buchmann, Johannes / Hamdy, Safuat
Pages 1-16

Algebraic groups and discrete logarithm
Couveignes, Jean-Marc
Pages 17-28

Fermat numbers, Wieferich and Wilson primes: computations and generalizations
Dilcher, Karl / Enge, Andreas
Pages 29-48

How to distinguish hyperelliptic curves in even characteristic
Enge, Andreas
Pages 49-58

Limitations of constructive Weil descent
Galbraith, Steven D.
Pages 59-70

On the security of a public-key cryptosystem
Grošek, Otokar / Magliveras, Spyros S. / Wei, Wandi
Pages 71-76

Optimizations for NTRU
Hoffstein, Jeffrey / Silverman, Joseph
Pages 77-88

The efficiency and security of a real quadratic field based key exchange protocol
Jacobson, Michael J. / Scheidler, Renate / Williams, Hugh C.
Pages 89-112

Extending the binary gcd algorithms
Kubiak, Przemysław
Pages 113-136

Stochastic kleptography detection
Kucner, Daniel / Kutylowski, Miroslaw
Pages 137-150

An overview of the XTR public key system
Lenstra, Arjen K. / Verheul, Eric R.
Pages 151-180

A survey of IND-CCA secure public-key encryption schemes relative to factoring
Müller, Siguna
Pages 181-196

Efficient point multiplication for elliptic curves over special optimal extension fields
Müller, Volker
Pages 197-208

Error-correcting codes and cryptography
Niederreiter, Harald
Pages 209-220

Secret public key schemes
Patarin, Jacques
Pages 221-238

Index form surfaces and construction of elliptic curves over large finite fields
Pethő, Attila
Pages 239-248

On the size of solutions of the inequality φ(ax + b) < φ(ax)
Riele, Herman te
Pages 249-256

Security of DL-encryption and signatures against generic attacks—a survey
Schnorr, Claus Peter
Pages 257-282

Square-root algorithms for the discrete logarithm problem (a survey)
Teske, Edlyn
Pages 283-302

Height functions on elliptic curves
Zimmer, Horst G.
Pages 303-322

List of participants
Pages 323-328

List of contributors
Pages 329-332