Topics in Cryptology - CT-RSA 2001 : the Cryptographers Track at RSA Conference 2001, San Francisco, CA, USA, April 8 12, 2001 : proceedings
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,...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2020 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Topics in cryptology, CT-RSA 2001, the Cryptographers' Track at RSA Conference 2001, San Francisco, CA, USA, April 2001, proceedings, David Naccache (ed.), 2001, Berlin [etc.], Springer, 1 vol. (XII-471 p.), Lecture notes in computer science, 3-540-41898-9 • Topics in Cryptology - CT-RSA 2001, Texte imprimé, 9783662166178 |
Obsah:
- 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.