UCL Crypto Group | Dr. Philippe Bulens

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

I am a member of the UCL Crypto Group. I obtained the degree of Civil Engineer in Electromechanic from the Université catholique de Louvain in 2003. I received my Ph. D. Degree in 2009. My dissertation was about "Mathematical and Physical Concerns regarding Cryptographic Key Length". My research interests include arithmetic, elliptic curves, algorithm implementation, fault attacks and fuzzy extractors.

Address:	Microelectronics Laboratory, Place du Levant, 3
Office:	b.107
Voice:	+32 (0) 10 47 81 07
Fax:	+32 (0) 10 47 25 98
E-Mail:

BibTeX - Bulens

Publications

Philippe Bulens, Damien Giry, and Olivier Pereira. Running Mixnet-Based Elections with Helios, In H. Shacham and V. Teague, editor(s), Electronic Voting Technology Workshop/Workshop on Trustworthy Elections, Usenix, August 2011 BibTeX

Philippe Bulens, François-Xavier Standaert, and Jean-Jacques Quisquater. How to Strongly Link Data and its Medium: the Paper Case, In IET Information Security, Volume 2-4, pages 125-236, September 2010 BibTeX

Chong Hee Kim, Philippe Bulens, Christophe Petit, and Jean-Jacques Quisquater. Fault Attacks on Public Key Elements: Application to DLP based Schemes, Fifth European PKI Workshop - EUROPKI 2008, Volume 5057 of Lecture Notes in Computer Science, pages 182 - 195, Springer, June 2008 PDF BibTeX

Philippe Bulens, François-Xavier Standaert, Jean-Jacques Quisquater, Pascal Pellegrin, and Gaël Rouvroy. Implementation of the AES-128 on Virtex-5 FPGAs, Progress in Cryptology - AfricaCrypt 2008, Volume 5023 of Lecture Notes in Computer Science, pages 16 - 26, Springer, June 2008 BibTeX

Guerric Meurice de Dormale, Philippe Bulens, and Jean-Jacques Quisquater. Collision Search for Elliptic Curve Discrete Logarithm over GF(2^m) with FPGA, Workshop on Cryptographic Hardware and Embedded Systems (CHES 2007), Volume 4727 of Lecture Notes in Computer Science, pages 378-393, Springer, September 2007 BibTeX

Philippe Bulens, Kassem Kalach, François-Xavier Standaert, and Jean-Jacques Quisquater. FPGA Implementations of eSTREAM Phase-2 Focus Candidates with Hardware Profile, January 2007, http://sasc.cry BibTeX

Philippe Bulens, Guerric Meurice de Dormale, and Jean-Jacques Quisquater. Hardware for Collision Search on Elliptic Curve over GF(2^m), Special-purpose Hardware for Attacking Cryptographic Systems (SHARCS'06), April 2006 BibTeX

Guerric Meurice de Dormale, Philippe Bulens, and Jean-Jacques Quisquater. An Improved Montgomery Modular Inversion Targeted for Efficient Implementation on FPGA, In O. Diessel & J.A. Williams, editor(s), International Conference on Field-Programmable Technology - FPT 2004, pages 441-444, December 2004 PDF BibTeX

Guerric Meurice de Dormale, Philippe Bulens, and Jean-Jacques Quisquater. Efficient Modular Division Implementation --ECC over GF(p) Affine Coordinates Application--, In J. Becker, M. Platzner, S. Vernalde, editor(s), The 14th International Conference on Field Programmable Logic and Applications --- FPL 2004, Volume 3203 of Lecture Notes in Computer Science, pages 231-240, Springer, September 2004 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.