Topics in Cryptology - CT-RSA 2001

New Cryptosystems.- Faster Generation of NICE-Schnorr-Type Signatures.- New Key Agreement Protocols in Braid Group Cryptography.- RSA.- Improving SSL Handshake Performance via Batching.- From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes.- An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits.- Symmetric Cryptography.- On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys.- Analysis of SHA-1 in Encryption Mode.- Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays.- Gambling and Lotteries.- Fair e-Lotteries and e-Casinos.- Secure Mobile Gambling.- Reductions, Constructions and Security Proofs.- Formal Security Proofs for a Signature Scheme with Partial Message Recovery.- The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES.- REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform.- Flaws and Attacks.- Security Weaknesses in Bluetooth.- Distinguishing Exponent Digits by Observing Modular Subtractions.- On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC.- Implementation.- Modular Exponentiation on Fine-Grained FPGA.- Scalable Algorithm for Montgomery Multiplication and its Implementation on the Coarse-Grain Reconfigurable Chip.- Software Implementation of the NIST Elliptic Curves Over Prime Fields.- Multivariate Cryptography.- The Security of Hidden Field Equations (HFE).- QUARTZ, 128-Bit Long Digital Signatures.- FLASH, a Fast Multivariate Signature Algorithm.- Number Theoretic Problems.- Analysis of the Weil Descent Attack of Gaudry, Hess and Smart.- Using Fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation.- Passwords and Credentials.- Relying Party Credentials Framework.- Password Authentication Using Multiple Servers.- More Efficient Password-Authenticated Key Exchange.- Protocols I.- Improved Boneh-Shaw