A Differential Fault Attack Technique against SPN Structures, with Application to the AES and KHAZAD
- G. Piret, J. Quisquater
- Mathematics, Computer ScienceWorkshop on Cryptographic Hardware and Embedded…
- 8 September 2003
The differential fault attack technique is able to break the AES-128 with only 2 faulty ciphertexts, assuming the fault occurs between the antepenultimate and the penultimate MixColumn; this is better than the previous fault attacks against AES.
Electing a University President Using Open-Audit Voting: Analysis of Real-World Use of Helios
- Olivier de Marneffe, Olivier Pereira, J. Quisquater
- Computer ScienceConference on Electronic voting technology…
- 10 August 2009
While it is often assumed that open-audit voting will lead to more complaints and potentially a denial-of-service attack on the auditing process, it is found that complaints are likely to be more easily handled in open- auditing elections because evidence and counter-evidence can be presented.
ElectroMagnetic Analysis (EMA): Measures and Counter-Measures for Smart Cards
- J. Quisquater, David Samyde
- Computer ScienceResearch in Smart Cards
- 19 September 2001
It is shown that the electromagnetic attack obtains at least the same result as power consumption and consequently must be carefuly taken into account.
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
- L. Guillou, J. Quisquater
- Computer Science, MathematicsAnnual International Cryptology Conference
- 21 August 1988
Additional features are introduced in order to provide: firstly, a mutual interactive authentication of both communicating entities and previously exchanged messages, and, secondly, a digital signature of messages, with a non-interactive zero-knowledge protocol.
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
- Paulo L. Barreto, Benoît Libert, N. McCullagh, J. Quisquater
- Computer Science, MathematicsInternational Conference on the Theory and…
- 4 December 2005
A new identity-based signcryption (IBSC) scheme built upon bilinear maps is described that is more efficient than all others proposed so far and also faster than all known pairing-based IBS methods.
Fast decipherment algorithm for RSA public-key cryptosystem
- J. Quisquater, C. Couvreur
- Computer Science, Mathematics
- 14 October 1982
A fast algorithm is presented for deciphering cryptograms involved in the public-key cryptosystem proposed by Rivest, Shamir and Adleman, based on the Chinese remainder theorem and on improved modular multiplication algorithms.
SEA: A Scalable Encryption Algorithm for Small Embedded Applications
- François-Xavier Standaert, G. Piret, N. Gershenfeld, J. Quisquater
- Computer ScienceSmart Card Research and Advanced Application…
- 19 April 2006
The proposed design is parametric in the text, key and processor size, allows efficient combination of encryption/decryption, “on-the-fly” key derivation and its security against a number of recent cryptanalytic techniques is discussed.
Template Attacks in Principal Subspaces
- C. Archambeau, Eric Peeters, François-Xavier Standaert, J. Quisquater
- Computer Science, MathematicsWorkshop on Cryptographic Hardware and Embedded…
- 10 October 2006
This work proposes to perform template attacks in the principal subspace of the traces, a new type of attack that requires five time less encrypted messages than the best reported correlation attack against similar block cipher implementations.
Compact and efficient encryption/decryption module for FPGA implementation of the AES Rijndael very well suited for small embedded applications
- G. Rouvroy, François-Xavier Standaert, J. Quisquater, J. Legat
- Computer Science, MathematicsInternational Conference on Information…
- 5 April 2004
This work purpose an efficient solution to combine Rijndael encryption and decryption in one FPGA design, with a strong focus on low area constraints, which fits into the smallest Xilinx FPGAs, deals with data streams of 208 Mbps, and improves by 68% the best-known similar designs in terms of ratio Throughput/Area.
Provably authenticated group Diffie-Hellman key exchange
- E. Bresson, O. Chevassut, D. Pointcheval, J. Quisquater
- Computer Science, MathematicsConference on Computer and Communications…
- 5 November 2001
This paper presents a security model for this problem and uses it to precisely define AKE (with "implicit" authentication) as the fundamental goal, and the entity-authentication goal as well, and defines the execution of an authenticated group Diffie-Hellman scheme and proves its security.
...
...