Public-key cryptography and computational number theory : proceedings of the international conference organized by the Stefan Banach International Mathematical Center, Warsaw, Poland, September 11-15, 2000

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. Main description: 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 Content: A survey on IQ cryptography, Johnnes Buchmann, Safuat Hamdy algebraic groups and discrete logarithm, Jean-Marc Couveignes fermat numbers, Wiefrich and Wilson primes - computations and generalizations, Karl Dilcher how to distinguish hyperelliptic curves in even characteristics, Andreas Enge limitations of constructive Weil descent, Steven D. Galbraith on the security of a public-key cryptosystem, Otokar Grosek, Spyros S. Magliveras, Wandi Wei optimizations for NTRU, Jeffrey Hoffstien, Joseph Silverman the effieciency and security of a real quadratic field based key exchange protocol, Michael John Jacobson Jr., Renate Scheider, Hugh C. Williams extending the binary gcd algorithms, Premyslaw Kubiak stochastic kleptography detection, Daniel Kucner, Miroslav Kutylowski. (Part contents).