FPGA's as Cryptanalytic Tools
(2002) IEEE Melecon 2002 conference — Location: Cairo, Egypt
Files
Details
- Authors
- Abstract
- This paper presents FPGA1 implementations of two cryptanalytic attacks against DES2. Linear cryptanalysis results from Matsui's work but could not be applied as such and had to be modified to face hardware constraints. We broke a key in about 14 hours on one single FPGA3, becoming the fastest implementation to our knowledge. In parallel, we evaluated the possibility of a cryptanalytic time-memory tradeoff using distinguished points. The original idea from Hellman [3] has never been implemented. We performed first experimental results and designed a machine that can break a 40-bit DES in about 15 seconds, with a high success rate (72%), using one PC4. An exhaustive search of the key on the same PC would have taken about 50 days.
- Affiliations
Citations
Rouvroy, G., & Standaert, F.-X. (2002). FPGA’s as Cryptanalytic Tools. IEEE Melecon 2002 conference, Cairo, Egypt. https://hdl.handle.net/2078.5/219169