Muutke küpsiste eelistusi

Cryptography and Computational Number Theory: Workshop in Singapore, 1999 [Kõva köide]

Edited by (National University of Singapore, Singapore), Edited by , Edited by (National University of Singapore, Singapore), Edited by , Edited by
Teised raamatud teemal:
  • Kõva köide
  • Hind: 76,45 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 89,95 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Teised raamatud teemal:
The fields of cryptography and computational number theory have recently witnessed a rapid development, which was the subject of the CCNT workshop in Singapore in November 1999. Its aim was to stimulate further research in information and computer security as well as the design and implementation of number theoretic cryptosystems and other related areas. Another achievement of the meeting was the collaboration of mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government. The present volume comprises a selection of refereed papers originating from this event, presenting either a survey of some area or original and new results. They concern many different aspects of the field such as theory, techniques, applications and practical experience. It provides a state-of-the-art report on some number theoretical issues of significance to cryptography.
Preface vii Computational Number Theory On the Dimension and the Number of Parameters of a Unirational Variety 3(8) C. Alonso J. Gutierrez R. Rubio On Elements of High Order in Finite Fields 11(4) A. Confitti Counting the Number of Points on Affine Diagonal Curves 15(10) C. Ding D.R. Kohel S. Ling Small Values of the Carmichael Function and Cryptographic Applications 25(8) J. Friedlander C. Pomerance I. E. Shaparlinski Density Estimates Related to Gauss Periods 33(10) J. von zur Gathen F. Pappalardi Distribution of the Coefficients of Primitive Polynomials over Finite Fields 43(16) W. Han The Distribution of the Quadratic Symbol in Function Fields and a Faster Mathematical Stream Cipher 59(10) J. Hoffstein D. Lieman Rational Groups of Elliptic Curves Suitable for Cryptography 69(12) D. Kohel Effective Determination of the Proportion of Split Primes in Number Fields 81(12) K. Y. Lam F. Sica Algorithms for Generating, Testing and Proving Primes: A Survey 93(30) P. Mihalescu Elliptic Curve Factorization Using a ``Partially Oblivious Function 123(6) R. Peralta The Hermite-Serret Algorithm and 122 + 332 129(8) A. J. van der Poorten Applications of Algebraic Curves to Constructions of Sequences 137(12) C. P. Xing Cryptography Designated 2-Verifier Proofs and their Application to Electronic Commerce 149(16) N. Alexandris M. Burmester V. Chrissikopoulos Y. Desmedt Divide and Conquer Attacks on Certain Irregularly Clocked Stream Ciphers 165(22) E. Dawson L. Simpson J. Golic New Results on the Randomness of Visual Cryptography Schemes 187(16) A. De Bonis A. De Santis Authentication -- Myths and Misconceptions 203(24) D. Gollmann A Survey of Bit - security and Hard Core Functions 227(30) M. I. Gonzales Vasco M. Naslund On the Security of Diffie-Hellman Bits 257(12) M. I. Gonzales Vasco I. E. Shparlinski Polynomial Rings and Efficient Public Key Authentication II 269(18) J. Hoffstein J. H. Silverman Security of Biased Sources for Cryptographic Keys 287(16) P. Mihalescu Achieving Optimal Fairness from Biased Coinflips 303(18) M. Naslund A. Russell The Dark Side of the Hidden Number Problem: Lattice Attacks on DSA 321(10) P. Q. Nguyen Distribution of Modular Sums and the Security of the Server Aided Exponentiation 331(12) P. Q. nguyen I. E. Shparlinski J. Stern A General Construction for Fail-Stop Signatures using Authentication Codes 343(14) R. Safavi-Naini W. Susilo Robust Additive Secret Sharing Schemes over Zm 357(12) R. Safavi-Naini H. Wang RSA Public Key Validation 369 R. D. Silverman