Public-Key Cryptography and Computational Number Theory
eBook - PDF

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

  1. 343 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

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

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • 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.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Public-Key Cryptography and Computational Number Theory by Kazimierz Alster, Jerzy Urbanowicz, Hugh C. Williams, Kazimierz Alster,Jerzy Urbanowicz,Hugh C. Williams in PDF and/or ePUB format, as well as other popular books in Mathematics & Algebra. We have over one million books available in our catalogue for you to explore.

Information

Publisher
De Gruyter
Year
2011
Print ISBN
9783110170467
eBook ISBN
9783110881035
Edition
1
Subtopic
Algebra

Table of contents

  1. Preface
  2. Mathematics, cryptology, and technology
  3. A survey on IQ cryptography
  4. Algebraic groups and discrete logarithm
  5. Fermat numbers, Wieferich and Wilson primes: computations and generalizations
  6. How to distinguish hyperelliptic curves in even characteristic
  7. Limitations of constructive Weil descent
  8. On the security of a public-key cryptosystem
  9. Optimizations for NTRU
  10. The efficiency and security of a real quadratic field based key exchange protocol
  11. Extending the binary gcd algorithms
  12. Stochastic kleptography detection
  13. An overview of the XTR public key system
  14. A survey of IND-CCA secure public-key encryption schemes relative to factoring
  15. Efficient point multiplication for elliptic curves over special optimal extension fields
  16. Error-correcting codes and cryptography
  17. Secret public key schemes
  18. Index form surfaces and construction of elliptic curves over large finite fields
  19. On the size of solutions of the inequality φ(ax + b) < φ(ax)
  20. Security of DL-encryption and signatures against generic attacks – a survey
  21. Square-root algorithms for the discrete logarithm problem (a survey)
  22. Height functions on elliptic curves
  23. List of participants
  24. List of contributors