photo

Fabrice Ben Hamouda

fr - en
45 rue d'Ulm
fabrice.ben.hamouda (at) ens.fr
75005 Paris
France
cv (en)  -  cv (fr)

I am a third year student at the Computer Science Departement of the École Normale Supérieure (ENS). Currently I am doing an internship in the Cryptography Team at the ENS under the supervision of Michel Abdalla and David Pointcheval. I am working on forward-secure signatures.

Projects and internships

  • Exploration of efficiency and side-channel security of different implementations of RSA

    Summer 2011 - 5 months internship
    Internship in the Cryptography group of the University of Bristol
    Supervisors: Elisabeth Oswald and Dan Page
    The Residue Number System (RNS) is a non-classical way to implement multi-precision arithmetic for RSA. Hardware implementations of RSA using RNS have already been proposed, but software implementations seem to have had far less attention. We analyse the time and space efficiency of RNS implementations of RSA on microprocessors and compare it with classical implementations. In addition, we propose an instruction set extension (ISE) designed to accelerate RNS on RISC-style processors. We also investigate two countermeasures, against some side-channel attacks, for RNS implementations of RSA, and we partially extend them to classical implementations.

  • Nooda

    Autumn 2011 - course project (ENS)
    Communication plateform
    nooda.net
    Project realised with Ludovic Patey. Original idea: Ludovic Patey.

  • Physical aggregated objects and dependability

    Summer 2011 - 3 months internship
    Internship in ACES team in INRIA Rennes
    report - slides (fr)
    Allard, F., Banâtre, M., Ben Hamouda, F., Couderc, P. & Verdonck, J.-F. (2011), "Physical aggregated objects and dependability", January, 2011. (RR-7512), pp. 33. [Abstract] [BibTeX] [URL]
    Abstract: This documents deals with dependability issues of aggregated objects and RFID-based systems. It analyses the dierent categories of issues raised by these objects and proposes some measures to face them. It also provides a state of the art of actual implementations of those solutions with multiple comparisons.
    BibTeX: 
    		@techreport{fbenhamoInria2010,
		  author = {Allard, Fabien and Banâtre, Michel and Ben Hamouda, Fabrice and Couderc, Paul and Verdonck, Jean-Francois},
		  title = {Physical aggregated objects and dependability},
		  year = {2011},
		  number = {RR-7512},
		  pages = {33},
		  url = {http://hal.inria.fr/inria-00556951/en/}
		}

  • Sqwarea

    Spring 2010 - course project (ENS)
    Online multiplayer game on Windows Azure
    sqwarea.com

  • Small microprocessor

    Spring 2010 - course project (ENS)
    And netlists simulator
    project - report - slides

Misc

  • P = NP with real numbers ?

    Fall 2009 - course presentation (ENS)
    Blum–Shub–Smale machines
    report (fr) - slides (fr)
    Presentation of the article:
    Fournier, H. & Koiran, P. (2000), "Lower Bounds Are Not Easier over the Reals: Inside PH", In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. , pp. 832-843. [BibTeX] [URL]
    BibTeX: 
    		@inproceedings{fournier2000lower,
		  author = {Fournier, H. and Koiran, P.},
		  title = {Lower Bounds Are Not Easier over the Reals: Inside PH},
		  booktitle = {Proceedings of the 27th International Colloquium on Automata, Languages and Programming},
		  year = {2000},
		  pages = {832--843},
		  url = {http://perso.ens-lyon.fr/pascal.koiran/Publis/lip.99-21.ps}
		}

  • An not so simple everyday flow

    2005-2006
    French Olympiads in Physics
    website (fr) - report (fr) - slides (fr)