Cryptography and Security: From Theory to Applications: Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday

511 Pages·2012·8.396 MB·English

by  Michaël Quisquater (auth.), David Naccache (eds.)

Lecture Notes in Computer Science 6805
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
David Naccache (Ed.)
Cryptography and Security:
From Theory toApplications
Essays Dedicated to Jean-Jacques Quisquater
on the Occasion of His 65th Birthday
1 3
VolumeEditor
DavidNaccache
Écolenormalesupérieure
Départementd’informatique
45Rued’Ulm
75231ParisCedex05,France
E-mail:[email protected]
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-28367-3 e-ISBN978-3-642-28368-0
DOI10.1007/978-3-642-28368-0
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2012931225
CRSubjectClassification(1998):E.3,K.6.5,D.4.6,C.2,J.1,G.2.1
LNCSSublibrary:SL4–SecurityandCryptology
©Springer-VerlagBerlinHeidelberg2012
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply,
evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws
andregulationsandthereforefreeforgeneraluse.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)

Preface
I met Jean-JacquesQuisquaterat Crypto 1992,one of my very firstconferences
in cryptography. I still remember the discussion we had that evening on DES
exhaustive search and on modular reduction algorithms. As a young researcher
I was impressed by the flow of information coming out of Jean-Jacque’s mouth:
algorithms,patents,products, designs,chiptechnologies,old cryptographicma-
chines... to an external observer the scene would have certainly reminded of
Marty McFly’s first encounter with Dr. Emmett Brown.
Twenty years later, here I sit, writing the preface to this volume dedicated
to Jean-Jacques’s retirement. Nonetheless, one might wonder what retirement
actually means for Jean-Jacques... While emeritus, Jean-Jacques continues to
conduct research with great passion, keep a regular contact with his friends in
the research community, attend conferences, serve as an elected IACR director,
write research papers and sermon young researchers about the quality of their
work.HeregularlyvisitsMITandUCL-Londonandinhisveryactiveretirement
hecontinuestoteachthe NumberTheorycourseatUCLandconsultforseveral
companies.
AsitwouldbeveryhardtoprovidehereathoroughaccountofJean-Jacques’s
r´esum´e,let me just mention some of his careerhighlights.Jean-Jacqueswas the
firsttoimplementDESinasmart-card(TRASECprojectin1985).Fordoingso,
Jean-Jacquescanbelegitimatelyregardedastheresearcherwhofirstintroduced
cryptographyintothesmart-cardindustry.AfterworkingontheDES,Jean-Jacques
turnedhisattentiontoimplementingRSAinsmart-cards.Hestartedbypropos-
ingatechniquethatimprovedRSAexecutionspeedbyafactorof250,000on8-bit
processors(Intel8051and Motorola6805)1. In 1986computing anRSA 512on
such processorstook about two minutes. Consequently, it was impossible to en-
visionanyusefuldeploymentofRSAinsmartcards2.Jean-Jacquesrolleduphis
sleevesandlaunchedtheCORSAIR(Philips)project,thatinawayremindsusof
the celebratedDeLoreanDMC-12 modifiedintoa time machine3:Jean-Jacques
started by adding up the effects of the Chinese Remainder Theorem and those
ofanewmodularmultiplicationalgorithm(nowcalledQuisquater’salgorithm4).
1 Theveryattentivereadermightnotethat6805isaveryspecialnumberinthisLNCS
volume...
2 Interestingly,thesituationisverysimilartotheimplementationoffullyhomomorphic
cryptosystemsintoday’s64-bitquad-coreprocessors!
3 For the young generation of cryptographers who did not see the movie and for the
oldergenerationwhodoesnotrememberitanymore:thecar’stimedisplacementwas
poweredbynuclearfissionusingplutoniumwhichpoured1.21gigawattsintoadevice
calledthe“fluxcapacitor”.
4 Onwhichthereaderwillfindaninterestingpaperinthepresentvolume.
VIII Preface
Thenhestrippedthefrequencydivideroffthedevice,addedahardwired8×8-bit
multiplierandgotsub-secondperformance(500factorspeed-up).
ThisdidnotfullysatisfyJean-Jacques.Hence,inepisodeII(awareofcompet-
ingeffortsbyBiffTannen,anothersiliconmanufacturer),Jean-Jacqueslaunched
the FAME project, to squeeze out of the device an extra 500 factor. The algo-
rithm was refined, the clock accelerated by a factor of 16, double-access RAM
was added and the multiplier’s size was extended to 16 and then to 32 bits. All
in all, thanks to Jean-Jacques’s efforts, by 1996 (i.e., in 10 years) a speed-up
factor of 250,000 was achieved, thereby exceeding Moore’s law provisions. This
stimulatedresearchandopenedcommercialperspectivestootherfirmswhoeven-
tually came up with creative alternatives. Until today, Philips (now NXP) uses
Quisquater’salgorithm.Thealgorithmwasduplicatedinaboutonebillionchips,
most notably in around 85% of all biometric passports issued as I write these
lines.
Jean-Jacques’scontributions to our field areconsiderable.Jean-Jacquesfiled
fundamental smart-card patents, authored more than 150 scientific papers in
graph theory and in cryptology and coached an entire generation of UCL cryp-
tographers. The GQ protocol (another saga that we cannot recount for lack
of space) bears his name. QG is used daily for authenticating data exchanges
throughouttheworldbymorethan100millionmachines.Jean-Jacquesreceived
many prestigious honors and marks of recognition from foreign and French-
speaking institutions.
WhenIaskedcolleaguestocontributetothisvolumetheresponsewasenthu-
siastic. The contributions came from many countries and concerned nearly all
the fields to which Jean-Jacquesdevoted his efforts during his academic career.
The authors of these contributions and I would like to thank Jean-Jacques
for his creativity and life-long work and to thank Springer for giving us the
opportunity to gather in this volume the expression of our gratitude to Jean-
Jacques.
October 2011 David Naccache

Table of Contents
Personal Tributes and Re-visits of Jean-Jacques’s
Legacy
The Hidden Side of Jean-JacquesQuisquater ........................ 1
Micha¨el Quisquater
On Quisquater’s Multiplication Algorithm........................... 3
Marc Joye
A Brief Survey of Research Jointly with Jean-Jacques Quisquater ...... 8
Yvo Desmedt
DES Collisions Revisited.......................................... 13
Sebastiaan Indesteege and Bart Preneel
Line Directed Hypergraphs........................................ 25
Jean-Claude Bermond, Fahir Ergincan, and Michel Syska
Symmetric Cryptography
Random Permutation Statistics and an Improved Slide-Determine
Attack on KeeLoq ............................................... 35
Nicolas T. Courtois and Gregory V. Bard
Self-similarity Attacks on Block Ciphers and Application to KeeLoq .... 55
Nicolas T. Courtois
Increasing Block Sizes Using Feistel Networks: The Example
of the AES...................................................... 67
Jacques Patarin, Benjamin Gittins, and Joana Treger
Authenticated-Encryption with Padding: A Formal Security
Treatment ...................................................... 83
Kenneth G. Paterson and Gaven J. Watson
Asymmetric Cryptography
Traceable Signature with Stepping Capabilities ...................... 108
Olivier Blazy and David Pointcheval
Deniable RSA Signature: The Raise and Fall of Ali Baba.............. 132
Serge Vaudenay
XII Table of Contents
Autotomic Signatures ............................................ 143
David Naccache and David Pointcheval
Fully Forward-SecureGroup Signatures............................. 156
Benoˆıt Libert and Moti Yung
Public Key Encryption for the Forgetful ............................ 185
Puwen Wei, Yuliang Zheng, and Xiaoyun Wang
Supplemental Access Control (PACE v2): Security Analysis of PACE
Integrated Mapping .............................................. 207
Jean-S´ebastien Coron, Aline Gouget, Thomas Icart, and
Pascal Paillier
Side Channel Attacks
Secret Key Leakage from Public Key Perturbation of DLP-Based
Cryptosystems................................................... 233
Alexandre Berzati, C´ecile Canovas-Dumas, and Louis Goubin
EM Probes Characterisationfor Security Analysis.................... 248
Benjamin Mounier, Anne-Lise Ribotta, Jacques Fournier,
Michel Agoyan, and Assia Tria
An Updated Survey on Secure ECC Implementations: Attacks,
Countermeasures and Cost ........................................ 265
Junfeng Fan and Ingrid Verbauwhede
Masking with Randomized Look Up Tables: Towards Preventing
Side-Channel Attacks of All Orders ................................ 283
Franc¸ois-Xavier Standaert, Christophe Petit, and
Nicolas Veyrat-Charvillon
Hardware and Implementations
Efficient Implementation of True Random Number Generator Based on
SRAM PUFs .................................................... 300
Vincent van der Leest, Erik van der Sluis, Geert-Jan Schrijen,
Pim Tuyls, and Helena Handschuh
Operand Folding Hardware Multipliers ............................. 319
Byungchun Chung, Sandra Marcello, Amir-Pasha Mirbaha,
David Naccache, and Karim Sabeg
SIMPL Systems as a Keyless Cryptographic and Security Primitive .... 329
Ulrich Ru¨hrmair
Table of Contents XIII
Cryptography with Asynchronous Logic Automata ................... 355
Peter Schmidt-Nielsen, Kailiang Chen, Jonathan Bachrach,
Scott Greenwald, Forrest Green, and Neil Gershenfeld
A Qualitative Security Analysis of a New Class of 3-D Integrated
Crypto Co-processors............................................. 364
Jonathan Valamehr, Ted Huffmire, Cynthia Irvine, Ryan Kastner,
C¸etin Kaya Koc¸, Timothy Levin, and Timothy Sherwood
Smart Cards and Information Security
The Challenges Raised by the Privacy-PreservingIdentity Card........ 383
Yves Deswarte and S´ebastien Gambs
The Next Smart Card Nightmare: Logical Attacks, Combined Attacks,
Mutant Applications and Other Funny Things....................... 405
Guillaume Bouffard and Jean-Louis Lanet
Localization Privacy.............................................. 425
Mike Burmester
Dynamic Secure Cloud Storage with Provenance ..................... 442
Sherman S.M. Chow, Cheng-Kang Chu, Xinyi Huang,
Jianying Zhou, and Robert H. Deng
Efficient Encryption and Storage of Close Distance Messages with
Applications to Cloud Storage ..................................... 465
George Davida and Yair Frankel
As Diverse as Jean-Jacques’ Scientific Interests
A Nagell Algorithm in Any Characteristic........................... 474
Mehdi Tibouchi
How to Read a Signature? ........................................ 480
Vanessa Gratzer and David Naccache
Fooling a Liveness-Detecting Capacitive Fingerprint Scanner .......... 484
Edwin Bowden-Peters, Raphael C.-W. Phan, John N. Whitley, and
David J. Parish
Physical Simulation of Inarticulate Robots .......................... 491
Guillaume Claret, Micha¨el Mathieu, David Naccache, and
Guillaume Seguin
Author Index.................................................. 501