Cryptographic hardware and embedded systems CHES 2001 : third international workshop, Paris, France, May 14 1
User Rating: Be the first one!
Author: CHES 2001 (2001 : Paris, France), Koç, Çetin K., 1957-, Naccache, David, 1967-, Paar, Christof, 1963-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Embedded computer systems, Cryptography, Computer security
Publishers: Berlin ; New York : Springer-Verlag
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540425217
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 207.12 MB
PDF Size: 4.65 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 612
Views: 662
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 44709 1 archive t...torrent
Last Modified: 2022-03-09 08:41:17
Download
Size: 12.20 KB
Description
Cryptographic Hardware and Embedded Systems — CHES 2001: Third International Workshop Paris, France, May 14–16, 2001 Proceedings
Author: Çetin K. Koç, David Naccache, Christof Paar
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42521-2
DOI: 10.1007/3-540-44709-1
Table of Contents:
Includes bibliographical references and index
Author: Çetin K. Koç, David Naccache, Christof Paar
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42521-2
DOI: 10.1007/3-540-44709-1
Table of Contents:
- Protecting Embedded Systems— The Next Ten Years
- A Sound Method for Switching between Boolean and Arithmetic Masking
- Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware
- Random Register Renaming to Foil DPA
- Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks
- Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael Algorithm
- High Performance Single-Chip FPGA Rijndael Algorithm Implementations
- Two Methods of Rijndael Implementation in Reconfigurable Hardware
- Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
- Efficient Online Tests for True Random Number Generators
- The Hessian Form of an Elliptic Curve
- Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve
- Generating Elliptic Curves of Prime Order
- New Directions in Croptography
- A New Low Complexity Parallel Multiplier for a Class of Finite Fields
- Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
- High-Radix Design of a Scalable Modular Multiplier
- A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
- Attacks on Cryptoprocessor Transaction Sets
- Bandwidth-Optimal Kleptographic Attacks
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts