|
|
Sold Out
Book Categories |
| Forward-Security in Private-Key Cryptography | 1 | |
| Intrusion-Resilient Public-Key Encryption | 19 | |
| TMAC: Two-Key CBC MAC | 33 | |
| Montgomery Prime Hashing for Message Authentication | 50 | |
| An Analysis of Proxy Signatures: Is a Secure Channel Necessary? | 68 | |
| Invisibility and Anonymity of Undeniable and Confirmor Signatures | 80 | |
| A Secure Signature Scheme from Bilinear Maps | 98 | |
| Access Control Using Pairing Based Cryptography | 111 | |
| NTRUSign: Digital Signatures Using the NTRU Lattice | 122 | |
| About the XL Algorithm over GF(2) | 141 | |
| Efficient GF(p[superscript m]) Arithmetic Architectures for Cryptographic Applications | 158 | |
| Hardware Performance Characterization of Block Cipher Structures | 176 | |
| Simple Identity-Based Cryptography with Mediated RSA | 193 | |
| Two Birds One Stone: Signcryption Using RSA | 211 | |
| Cryptography after the Bubble: How to Make an Impact on the World | 226 | |
| Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption | 227 | |
| Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes | 244 | |
| Fault Tolerant and Distributed Broadcast Encryption | 263 | |
| Shared Generation of Pseudo-Random Functions with Cumulative Maps | 281 | |
| Authenticated Data Structures for Graph and Geometric Searching | 295 | |
| Fractal Merkle Tree Representation and Traversal | 314 | |
| RSA Shortcuts | 327 | |
| The Width-[omega] NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks | 328 | |
| Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation | 343 | |
| Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures | 355 | |
| Secure Applications of Pedersen's Distributed Key Generation Protocol | 373 | |
| Seeing through Mist Given a Small Fraction of an RSA Private Key | 391 | |
| Simple Backdoors for RSA Key Generation | 403 | |
| Author Index | 417 |
| Price | Condition | Delivery | Seller | Action |
| $107.90 | Digital |
| WonderClub |
Eric Laborde
reviewed Topics in Cryptology -- CT-RSA 2003 on January 09, 2017 Topics in Cryptology -- CT-RSA 2003
Too terse for my taste. The proofs are too telegraphic, probably with the intention of treating a large number of theorems / results. It's an excellent compendium (a lot of new material) but it's not a book to learn Graph Theory from.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Topics in Cryptology -- CT-RSA 2003
X
This Item is in Your Inventory
Topics in Cryptology -- CT-RSA 2003
X
You must be logged in to review the productsX
X
X
Add Topics in Cryptology -- CT-RSA 2003, This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2003, CT-RSA 2003, held in San Francisco, CA, USA, in April 2003. The 26 revised full papers presented together with abstracts of 2 invited talks were car, Topics in Cryptology -- CT-RSA 2003 to the inventory that you are selling on WonderClubX
X
Add Topics in Cryptology -- CT-RSA 2003, This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2003, CT-RSA 2003, held in San Francisco, CA, USA, in April 2003. The 26 revised full papers presented together with abstracts of 2 invited talks were car, Topics in Cryptology -- CT-RSA 2003 to your collection on WonderClub |
