An FPGA Implementation of the Linear Cryptanalysis (2002)
Cached
Download Links
- [www.dice.ucl.ac.be]
- [www.comms.scitech.susx.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In 12th International Conference on Field Programmable Logic and Applications (FPL 2002 |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Koeune02anfpga,
author = {François Koeune and Gael Rouvroy and François-Xavier Standaert and Francois-xavier St and Jean-Jacques Quisquater and Jean-pierre David and Jean-didier Legat},
title = {An FPGA Implementation of the Linear Cryptanalysis},
booktitle = {In 12th International Conference on Field Programmable Logic and Applications (FPL 2002},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper deals with cryptographic concepts. It presents a hardware FPGA implementation of linear cryptanalysis of DES. Linear cryptanalysis is the best attack known able to break DES faster than exhaustive search. Matsui's original attack [4, 5] could not be applied as such, and we had to implement a modified attack [1] to face hardware constraints. The resulting attack is less efficient than Matsui's attack, but fits in our hardware and breaks a DES key in 12-15 hours on one single FPGA, therefore becoming the first practical implementation to our knowledge. As a comparison, the fastest implementation known so far used the idle time of 18 Intel Pentium III MMX, and broke a DES key in 4.32 days. Our fast implementation...
Citations
| 136 | Digital integrated circuits - Rabaey - 1996 |
| 112 | The First Experimental Cryptanalysis of the Data Encryption Standard - Matsui - 1994 |
| 94 | Cryptanalysis Methods for DES Cipher - Linear - 1994 |
| 12 | A chosen-plaintext linear attack on DES - Knudsen, Mathiassen - 2000 |
| 12 | On the Complexity of Matsui’s Attack - Junod - 2001 |
| 4 | 2.5V field programmable gate arrays data sheet. available from http://www.xilinx.com - Virtex - 2001 |
| 1 | Linear cryptanalysis of DES - Junod - 2000 |
