Cryptographic hardware and embedded systems -- CHES 2003. 5th international workshop, Cologne, Germany, September 8--10, 2003. Proceedings
type: Item
instance of: scholarly article
title: Cryptographic hardware and embedded systems -- CHES 2003. 5th international workshop, Cologne, Germany, September 8--10, 2003. Proceedings
zbMATH Open document ID: 1027.00034
DOI: 10.1007/978-3-540-45238-6
published in: Lecture Notes in Computer Science
publication date: 2003-12-08T00:00:00Z
review text: The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 1007.00053). Indexed articles: \textit{Karlof, Chris; Wagner, David}, Hidden Markov model cryptanalysis., 17-34 [Zbl 1274.94086] \textit{Geiselmann, Willi; Steinwandt, Rainer}, Hardware to solve sparse systems of linear equations over GF(2)., 51-61 [Zbl 1274.94069] \textit{Piret, Gilles; Quisquater, Jean-Jacques}, A differential fault attack technique against SPN structures, with application to the AES and KHAZAD., 77-88 [Zbl 1274.94107] \textit{Coron, Jean-Sébastien; Tchulkine, Alexei}, A new algorithm for switching from arithmetic to Boolean masking., 89-97 [Zbl 1274.94055] \textit{Barak, Boaz; Shaltiel, Ronen; Tromer, Eran}, True random number generators secure in a changing environment., 166-180 [Zbl 1274.94037] \textit{Dichtl, Markus}, How to predict the output of a hardware random number generator., 181-188 [Zbl 1274.94061] \textit{Reyhani-Masoleh, Arash; Hasan, M. Anwar}, On low complexity bit parallel polynomial basis multipliers., 189-202 [Zbl 1274.11178] \textit{Dhem, Jean-François}, Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right'' modular multiplication in \(\mathbb F_2[x]\)., 203-213 [Zbl 1274.11174] \textit{Chevallier-Mames, Benoît; Joye, Marc; Paillier, Pascal}, Faster double-size modular multiplication from Euclidean multipliers, 214-227 [Zbl 1274.11173] \textit{Kwon, Soonhak; Kim, Chang Hoon; Hong, Chun Pyo}, Efficient exponentiation for a class of finite fields GF\((2^{n })\) determined by Gauss periods., 228-242 [Zbl 1274.11177] \textit{Joye, Marc; Paillier, Pascal}, GCD-free algorithms for computing modular inverses., 243-253 [Zbl 1274.11176] \textit{Fouque, Pierre-Alain; Martinet, Gwenaëlle; Poupard, Guillaume}, Attacking unbalanced RSA-CRT using SPA., 254-268 [Zbl 1274.94065] \textit{Fouque, Pierre-Alain; Valette, Frederic}, The doubling attack -- why upwards is better than downwards., 2…
Mathematics Subject Classification ID: 00B25
Mathematics Subject Classification ID: 68-06
Mathematics Subject Classification ID: 94-06
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 2014656
zbMATH Keywords: Cryptographic hardware
zbMATH Keywords: Embedded systems
zbMATH Keywords: CHES 2003
zbMATH Keywords: Cologne (Germany)
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/978-3-540-45238-6
OpenAlex ID: W1573553750
description: scientific article; zbMATH DE number 2014656