Public-Key Cryptography and Computational Number Theory
-
Edited by:
Kazimierz Alster
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.
Topics
-
Requires Authentication UnlicensedLicensed
I-VI
I -
Requires Authentication UnlicensedLicensed
Preface
VII -
Requires Authentication UnlicensedLicensed
Mathematics, cryptology, and technology
IX -
Requires Authentication UnlicensedLicensed
Table of contents
XI -
Requires Authentication UnlicensedLicensed
A survey on IQ cryptography
1 -
Requires Authentication UnlicensedLicensed
Algebraic groups and discrete logarithm
17 -
Requires Authentication UnlicensedLicensed
Fermat numbers, Wieferich and Wilson primes: computations and generalizations
29 -
Requires Authentication UnlicensedLicensed
How to distinguish hyperelliptic curves in even characteristic
49 -
Requires Authentication UnlicensedLicensed
Limitations of constructive Weil descent
59 -
Requires Authentication UnlicensedLicensed
On the security of a public-key cryptosystem
71 -
Requires Authentication UnlicensedLicensed
Optimizations for NTRU
77 -
Requires Authentication UnlicensedLicensed
The efficiency and security of a real quadratic field based key exchange protocol
89 -
Requires Authentication UnlicensedLicensed
Extending the binary gcd algorithms
113 -
Requires Authentication UnlicensedLicensed
Stochastic kleptography detection
137 -
Requires Authentication UnlicensedLicensed
An overview of the XTR public key system
151 -
Requires Authentication UnlicensedLicensed
A survey of IND-CCA secure public-key encryption schemes relative to factoring
181 -
Requires Authentication UnlicensedLicensed
Efficient point multiplication for elliptic curves over special optimal extension fields
197 -
Requires Authentication UnlicensedLicensed
Error-correcting codes and cryptography
209 -
Requires Authentication UnlicensedLicensed
Secret public key schemes
221 -
Requires Authentication UnlicensedLicensed
Index form surfaces and construction of elliptic curves over large finite fields
239 -
Requires Authentication UnlicensedLicensed
On the size of solutions of the inequality φ(ax + b) < φ(ax)
249 -
Requires Authentication UnlicensedLicensed
Security of DL-encryption and signatures against generic attacks—a survey
257 -
Requires Authentication UnlicensedLicensed
Square-root algorithms for the discrete logarithm problem (a survey)
283 -
Requires Authentication UnlicensedLicensed
Height functions on elliptic curves
303 -
Requires Authentication UnlicensedLicensed
List of participants
323 -
Requires Authentication UnlicensedLicensed
List of contributors
329
-
Manufacturer information:
Walter de Gruyter GmbH
Genthiner Straße 13
10785 Berlin
productsafety@degruyterbrill.com
