+612 9045 4394
 
CHECKOUT
Public-Key Cryptography and Computational Number Theory : September 11-15, 2000, Warsaw, Poland :  September 11-15, 2000, Warsaw, Poland - Kazimierz Alster

Public-Key Cryptography and Computational Number Theory : September 11-15, 2000, Warsaw, Poland

September 11-15, 2000, Warsaw, Poland

By: Kazimierz Alster (Editor), Jerzy Urbanowicz (Editor), Hugh C. Williams (Editor)

Hardcover Published: 2001
ISBN: 9783110170467
Number Of Pages: 343
For Ages: 22+ years old

Share This Book:

Hardcover

RRP $747.99
$517.50
31%
OFF
or 4 easy payments of $129.38 with Learn more
Ships in 7 to 10 business days

The proceedings contain 20 selected, refered contributions arising from the International Conference on Public-Key Cryptography and Computational Number Theory held in Warsaw, Poland, on September 11-15, 2000. This volume contains articles from leading experts in the world on cryptography and computational number thoery, 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 Rozycki (1909-1942) and Henryk Zygalski (1907-1978), who deciphered the miltary version of the famous Enigma in December 1932-January 1933.

Prefacep. vii
Mathematics, cryptology, and technologyp. ix
A survey on IQ cryptographyp. 1
Algebraic groups and discrete logarithmp. 17
Fermat numbers, Wieferich and Wilson primes: computations and generalizationsp. 29
How to distinguish hyperelliptic curves in even characteristicp. 49
Limitations of constructive Weil descentp. 59
On the security of a public-key cryptosystemp. 71
Optimizations for NTRUp. 77
The efficiency and security of a real quadratic field based key exchange protocolp. 89
Extending the binary gcd algorithmsp. 113
Stochastic kleptography detectionp. 137
An overview of the XTR public key systemp. 151
A survey of IND-CCA secure public-key encryption schemes relative to factoringp. 181
Efficient point multiplication for elliptic curves over special optimal extension fieldsp. 197
Error-correcting codes and cryptographyp. 209
Secret public key schemesp. 221
Index form surfaces and construction of elliptic curves over large finite fieldsp. 239
On the size of solutions of the inequality [phi](ax + b) < [phi](ax)p. 249
Security of DL-encryption and signatures against generic attacks--a surveyp. 257
Square-root algorithms for the discrete logarithm problem (a survey)p. 283
Height functions on elliptic curvesp. 303
List of participantsp. 323
List of contributorsp. 329
Table of Contents provided by Syndetics. All Rights Reserved.

ISBN: 9783110170467
ISBN-10: 3110170469
Series: De Gruyter Proceedings in Mathematics
Audience: Professional
For Ages: 22+ years old
Format: Hardcover
Language: English
Number Of Pages: 343
Published: 2001
Country of Publication: DE
Dimensions (cm): 24.41 x 16.99  x 2.06
Weight (kg): 0.75