Public-Key Cryptography and Computational Number Theory (eBook)

Contents:

Andrew Odlyzko: Mathematics, cryptology, and technology · Johannes Buchmann, Safuat Hamdy: A survey on IQ cryptography · Jean-Marc Couveignes: Algebraic groups and discrete logarithm · Karl Dilcher: Fermat numbers, Wieferich and Wilson primes: computations and generalizations· Andreas Enge: How to distinguish hyperelliptic curves in even characteristic · Steven D. Galbraith: Limitations of constructive Weil descent · Otokar Grošek, Spyros S. Magliveras, Wandi Wei: On the security of a public-key cryptosystem · Jeffrey Hoffstein, Joseph Silverman: Optimizations for NTRU · Michael John Jacobson, Jr., Renate Scheidler, Hugh C. Williams: The efficiency and security of a real quadratic field based key exchange protocol · Przemyslaw Kubiak: Extending the binary gcd algorithms · Daniel Kucner, Miroslaw Kutylowski: Stochastic kleptography detection · Arjen K. Lenstra, Eric R. Verheul: An overview of the XTR public key system · Siguna Müller: A survey of IND-CCA secure public-key encryption schemes relative to factoring · Volker Müller: Efficient point multiplication for elliptic curves over special optimal extension fields · Harald Niederreiter: Error-correcting codes and cryptography · Secret public key schemes · Attila Pethö: Index form surfaces and construction of elliptic curves over large finite fields · Herman te Riele: On the size of solutions of the inequality (ax+b)< (ax) · Claus Peter Schnorr: Security of DL-encryption and signatures against generic attacks - a survey · Edlyn Teske: Square-root algorithms for the discrete logarithm problem (a survey) · Horst G. Zimmer: Height functions on elliptic curves.