Topics in Cryptology - CT-RSA 2001 The Cryptographer's Track at RSA Conference 2001 San Francisco, CA, USA, April 8-12, 2001 Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Naccache, David (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Edition: 1st ed. 2001.
• Series: Lecture Notes in Computer Science, 2020
• Subjects: Data encryption (Computer science).; Computer science-Mathematics.; Operating systems (Computers).; Algorithms.; Computer communication systems.; Management information systems.; Computer science.; Cryptology.; Mathematics of Computing.; Operating Systems.; Algorithm Analysis and Problem Complexity.; Computer Communication Networks.; Management of Computing and Information Systems.

You are holding the rst in a hopefully long and successful series of RSA Cr- tographers' Track proceedings. The Cryptographers' Track (CT-RSA) is one of the many parallel tracks of the yearly RSA Conference. Other sessions deal with government projects, law and policy issues, freedom and p...

Table of Contents:

• 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 Content Fingerprinting
• Efficient Asymmetric Public-Key Traitor Tracing Without Trusted Agents
• Targeted Advertising ... and Privacy Too
• Protocols II
• Uncheatable Distributed Computations
• Forward-Secure Threshold Signature Schemes
• A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires.