Skip to search formSkip to main contentSkip to account menu

A Differential Fault Attack Technique against SPN Structures, with Application to the AES and KHAZAD

  • G. PiretJ. Quisquater
  • Mathematics, Computer Science
    Workshop 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.
View via Publisher (opens in a new tab)

Electing a University President Using Open-Audit Voting: Analysis of Real-World Use of Helios

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.
View Paper (opens in a new tab)

ElectroMagnetic Analysis (EMA): Measures and Counter-Measures for Smart Cards

It is shown that the electromagnetic attack obtains at least the same result as power consumption and consequently must be carefuly taken into account.
View via Publisher (opens in a new tab)

A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge

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.
View via Publisher (opens in a new tab)

Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps

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.
View via Publisher (opens in a new tab)

Fast decipherment algorithm for RSA public-key cryptosystem

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.
View via Publisher (opens in a new tab)

SEA: A Scalable Encryption Algorithm for Small Embedded Applications

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.
View via Publisher (opens in a new tab)

Template Attacks in Principal Subspaces

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.
View via Publisher (opens in a new tab)

Compact and efficient encryption/decryption module for FPGA implementation of the AES Rijndael very well suited for small embedded applications

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.
View on IEEE (opens in a new tab)

Provably authenticated group Diffie-Hellman key exchange

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.
View on ACM (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)