UCL Crypto Group | Dr. Marc Joye

Disclaimer: This page refers to former member of the group. Validity or accuracy of the following information is thus not guaranteed in any way.

E-Mail:
Homepage:	http://www.thlab.net/~joyem/

Seminars given

January 29, 2003 - Elliptic Curve Cryptography and Side-Channel Analysis
by Dr. Marc Joye

BibTeX - Joye

Publications

Mathieu Ciet, Marc Joye, Kristin Lauter, and Peter L. Montgomery. Trading inversions for multiplications in elliptic curve cryptography, In Designs, Codes and Cryptography, Volume 39-2, pages 189 - 206, May 2006 BibTeX

Mathieu Ciet, and Marc Joye. Elliptic curve cryptosystems in the presence of permanent and transient faults, In Designs Codes and Cryptography, Volume 36-1, July 2005 BibTeX

Benoit Chevallier-Mames, Mathieu Ciet, and Marc Joye. Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Side-Channel Atomicity, In IEEE Transactions on Computers, Volume 53-6, pages 760-768, June 2004 BibTeX

Mathieu Ciet, and Marc Joye. (Virtually) Free randomization techniques for elliptic curve cryptography, In S. Qing, D. Gollmann, and J. Zhou, editor(s), Information and Communications Security (ICICS 2003), Volume 2836 of Lecture Notes in Computer Science, Springer-Verlag, October 2003 BibTeX

Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, and Moti Yung. Observability Analysis: Detecting when Improved Cryptosystems Fail, RSA Conference 2002, San Jose, USA, Volume 2271 of Lecture Notes in Computer Science, pages 17-29, Springer-Verlag, February 2002 PDF BibTeX

Marc Joye, and Jean-Jacques Quisquater. On Rabin-type Signatures, Cryptography and Coding - 8th IMA International Conference on Cryptography and Coding, Volume 2260 of Lecture Notes in Computer Science, pages 99-113, Springer-Verlag, December 2001 PDF BibTeX

Marc Joye, Jean-Jacques Quisquater, and Tsuyoshi Takagi. How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves, In Designs, Codes and Cryptography, Volume 23-3, pages 297-316, August 2001 PDF BibTeX

Marc Joye, and Jean-Jacques Quisquater. Hessian Elliptic Curves and Side-Channel Attacks, Proceedings of Cryptographic Hardware and Embedded Systems - CHES 2001, Volume 2162 of Lecture Notes in Computer Science, pages 402-410, Springer-Verlag, May 2001 BibTeX

Marc Joye, Jean-Jacques Quisquater, and Moti Yung. On the power of misbehaving adversaries and security analysis of the original EPOC, Topics in Cryptology - CT-RSA 2001, Volume 2020 of Lecture Notes in Computer Science, pages 208-222, Springer-Verlag, April 2001 PDF BibTeX

Arjen K. Lenstra, Marc Joye, and Jean-Jacques Quisquater. Chinese remaindering cryptosystems in the presence of faults, In Journal of Cryptology, Volume 12-4, pages 241-245, January 1999 BibTeX

Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, and Moti Yung. Security paradoxes: How improving a cryptosystem may weaken it, Ninth National Conference on Information Security, Taichung, Taiwan, pages 27-32, January 1999 BibTeX

Marc Joye, and Jean-Jacques Quisquater. Cryptanalysis of RSA-type cryptosystems: a visit, In R. N. Wright and P. G. Neumann, editor(s), Network Threats, DIMACS Series in Discrete Mathematics an, pages 21-31, American Mathematical Society, January 1998 PDF BibTeX

Marc Joye, and Jean-Jacques Quisquater. Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams, Designs, Codes and Cryptography, Volume 14, pages 53-56, January 1998 PDF BibTeX

Marc Joye, Jean-Jacques Quisquater, and Tsuyoshi Takagi. Are strong primes really stronger?, In D.J. Guan, editor(s), Proc. of the Eighth National Symposium on Information Security, pages 355-367, January 1998 BibTeX

Marc Joye, and Jean-Jacques Quisquater. Protocol failures for RSA-like functions using Lucas sequences and elliptic curves, Security Protocols 1996, Volume 1189 of Lecture Notes in Computer Science, pages 93-100, Springer-Verlag, January 1997 PDF BibTeX

Jean-Jacques Quisquater, Benoit Macq, Marc Joye, N. Degand, and A. Bernard. Practical solution to authentication of images with a secure camera, In I.K. Sethi and R.C. Jain, editor(s), Storage and Retrieval for Image and Video Databases, Volume 3022, pages 290-297, SPIE, January 1997 BibTeX

Marc Joye. On the importance of securing your bins: The garbage-man-in-the-middle attack, In T. Matsumoto, editor(s), 4th ACM Conference on Computer and Communications Security, pages 135-141, ACM Press, January 1997 PDF BibTeX

D. Bleichenbacher, Marc Joye, and Jean-Jacques Quisquater. A new and optimal chosen-message attack on RSA-type cryptosystems, In Y. Han, T. Okamoto and S. Qing, editor(s), Information and Communications Security (ICICS'97), Volume 1334 of Lecture Notes in Computer Science, Springer-Verlag, January 1997 PDF BibTeX

Marc Joye, and Jean-Jacques Quisquater. Authentication of sequences with the SL2 hash function: Application to video sequences, In Journal of Computer Security, Volume 5-3, pages 213-223, January 1997 PDF BibTeX

A. Gillet, Marc Joye, and Jean-Jacques Quisquater. Cautionary note for protocols designers: Security proof is not enough, In H. Orman and C. Meadows, editor(s), DIMACS Workshop on Design and Formal Verification of Security Protocols, January 1997 PDF BibTeX

Jean-François Dhem, Marc Joye, and Jean-Jacques Quisquater. RSA-type signatures in the presence of transient faults, In M. Darnell, editor(s), Cryptography and Coding, Volume 1355 of Lecture Notes in Computer Science, pages 155-160, Springer-Verlag, January 1997 PDF BibTeX

Marc Joye, and Jean-Jacques Quisquater. Cryptosystem of Chua and Ling, In Electronic Letters, Volume 33, pages 1938, January 1997 BibTeX

Marc Joye, Jean-Jacques Quisquater, Feng Bao, and Robert H. Deng. RSA-type cryptosystems in the presence of transient faults, In Cryptography and Coding, Volume 1355, pages 155-160, January 1997 BibTeX

Marc Joye, and Jean-Jacques Quisquater. Efficient computation of full Lucas sequences, In IEE Electronics Letters, Volume 32-6, pages 537-538, January 1996 PDF BibTeX

Copyright Notice

(click here to expand/retract)

Some material that is available from this page is copyrighted.

IACR Copyright Notice: Permission is granted for a user to display all material at this site, to copy the material onto a single computer, and to make print copies of the material for personal use only. All other rights are retained by the International Association for Cryptologic Research. In particular, any other copying, other redistribution, or any commercial use of the material requires the permission of the publisher, which may be requested by contacting the International Association for Cryptologic Research.

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright © 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.