
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
- 343 pages
- English
- PDF
- Available on iOS & Android
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
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Preface
- Mathematics, cryptology, and technology
- A survey on IQ cryptography
- Algebraic groups and discrete logarithm
- Fermat numbers, Wieferich and Wilson primes: computations and generalizations
- How to distinguish hyperelliptic curves in even characteristic
- Limitations of constructive Weil descent
- On the security of a public-key cryptosystem
- Optimizations for NTRU
- The efficiency and security of a real quadratic field based key exchange protocol
- Extending the binary gcd algorithms
- Stochastic kleptography detection
- An overview of the XTR public key system
- A survey of IND-CCA secure public-key encryption schemes relative to factoring
- Efficient point multiplication for elliptic curves over special optimal extension fields
- Error-correcting codes and cryptography
- Secret public key schemes
- Index form surfaces and construction of elliptic curves over large finite fields
- On the size of solutions of the inequality φ(ax + b) < φ(ax)
- Security of DL-encryption and signatures against generic attacks – a survey
- Square-root algorithms for the discrete logarithm problem (a survey)
- Height functions on elliptic curves
- List of participants
- List of contributors