Topics in Cryptology - CT-RSA 2001

1. Front Matter

   Pages I-XII

   PDF

2. New Cryptosystems

   1. Faster Generation of NICE-Schnorr-Type Signatures

      • Detlef Hühnlein

      Pages 1-12

   2. New Key Agreement Protocols in Braid Group Cryptography

      • Iris Anshel, Michael Anshel, Benji Fisher, Dorian Goldfeld

      Pages 13-27

3. RSA

   1. Improving SSL Handshake Performance via Batching

      • Hovav Shacham, Dan Boneh

      Pages 28-43

   2. From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes

      • Geneviève Arboit1, Jean-Marc Robert

      Pages 44-51

   3. An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits

      • Ron Steinfeld, Yuliang Zheng

      Pages 52-62

4. Symmetric Cryptography

   1. On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys

      • Paul Onions

      Pages 63-69

   2. Analysis of SHA-1 in Encryption Mode

      • Helena Handschuh, Lars R. Knudsen, Matthew J. Robshaw

      Pages 70-83

   3. Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays

      • Kris Gaj, Pawel Chodowiec

      Pages 84-99

5. Gambling and Lotteries

   1. Fair e-Lotteries and e-Casinos

      • Eyal Kushilevitz, Tal Rabin

      Pages 100-109

   2. Secure Mobile Gambling

      • Markus Jakobsson, David Pointcheval, Adam Young

      Pages 110-125

6. Reductions, Constructions and Security Proofs

   1. Formal Security Proofs for a Signature Scheme with Partial Message Recovery

      • Daniel R. L. Brown, Don B. Johnson

      Pages 126-142

   2. The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES

      • Michel Abdalla, Mihir Bellare, Phillip Rogaway

      Pages 143-158

   3. REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

      • Tatsuaki Okamoto, David Pointcheval

      Pages 159-174

7. Flaws and Attacks

   1. Security Weaknesses in Bluetooth

      • Markus Jakobsson, Susanne Wetzel

      Pages 176-191

   2. Distinguishing Exponent Digits by Observing Modular Subtractions

      • Colin D. Walter, Susan Thompson

      Pages 192-207

   3. On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC

      • Marc Joye, Jean-Jacques Quisquater, Moti Yung

      Pages 208-222

8. Implementation

   1. Modular Exponentiation on Fine-Grained FPGA

      • Alexander Tiountchik, Elena Trichina

      Pages 223-234

   2. Scalable Algorithm for Montgomery Multiplication and its Implementation on the Coarse-Grain Reconfigurable Chip

      • Elena Trichina, Alex Tiountchik

      Pages 235-249

   3. Software Implementation of the NIST Elliptic Curves Over Prime Fields

      • Michael Brown, Darrel Hankerson, Julio López, Alfred Menezes

      Pages 250-265

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 privacy news, analysts’ opinions, standards, ASPs, biotech and healthcare, nance, telecom and wireless security, developers, new products, implementers, threats, RSA products, VPNs, as well as cryp- graphy and enterprise tutorials. RSA Conference 2001 is expected to continue the tradition and remain the largest computer security event ever staged: 250 vendors, 10,000 visitors and 3,000 class-going attendees are expected in San Francisco next year. I am very grateful to the 22 members of the program committee for their hard work. The program committee received 65 submissions (one of which was later withdrawn) for which review was conducted electronically; almost all papers had at least two reviews although most had three or more. Eventually, we accepted the 33 papers that appear in these proceedings. Revisions were not checked on their scienti c aspects and some authors will write nal versions of their papers for publication in refereed journals. As is usual, authors bear full scienti c and paternity responsibilities for the contents of their papers.

• Access Control
• Authentication
• Bluetooth
• Computational Number Theory
• Cryptoanalysis
• Cryptographic Protocools
• Cryptography
• DES
• Data Security
• Information Security
• RSA
• Signatur
• algorithms
• calculus
• cryptology
• algorithm analysis and problem complexity

• Gemplus Card International, Issy les Moulineaux, France

  David Naccache

Policies and ethics