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 ( De Gruyter Proceedings in Mathematics )

Publication subTitle :Proceedings of the International Conference organized by the Stefan Banach International Mathematical Center Warsaw, Poland, September 11-15, 2000

Publication series :De Gruyter Proceedings in Mathematics

Author: Kazimierz Alster   Jerzy Urbanowicz   Hugh C. Williams  

Publisher: De Gruyter‎

Publication year: 2001

E-ISBN: 9783110881035

P-ISBN(Paperback): 9783110170467

Subject:

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

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.

 

Chapter

Preface

pp.:  1 – 7

A survey on IQ cryptography

pp.:  9 – 13

How to distinguish hyperelliptic curves in even characteristic

pp.:  41 – 61

Limitations of constructive Weil descent

pp.:  61 – 71

On the security of a public-key cryptosystem

pp.:  71 – 83

Optimizations for NTRU

pp.:  83 – 89

The efficiency and security of a real quadratic field based key exchange protocol

pp.:  89 – 101

Extending the binary gcd algorithms

pp.:  101 – 125

Stochastic kleptography detection

pp.:  125 – 149

An overview of the XTR public key system

pp.:  149 – 163

A survey of IND-CCA secure public-key encryption schemes relative to factoring

pp.:  163 – 193

Efficient point multiplication for elliptic curves over special optimal extension fields

pp.:  193 – 209

Error-correcting codes and cryptography

pp.:  209 – 221

Secret public key schemes

pp.:  221 – 233

Index form surfaces and construction of elliptic curves over large finite fields

pp.:  233 – 251

On the size of solutions of the inequality φ(ax + b) < φ(ax)

pp.:  251 – 261

Security of DL-encryption and signatures against generic attacks – a survey

pp.:  261 – 269

Square-root algorithms for the discrete logarithm problem (a survey)

pp.:  269 – 295

Height functions on elliptic curves

pp.:  295 – 315

List of participants

pp.:  315 – 335

List of contributors

pp.:  335 – 341

LastPages

pp.:  341 – 345

The users who browse this book also browse


No browse record.