Cryptanalysis of PRESENT via CUDA devices

Date

2014-03-27

Author

Tezcan, Cihangir
Temizel, Alptekin

Metadata

Show full item record

Item Usage Stats

63
views

0
downloads

We show that CUDA devices provide more than 10.9x speed up when performing exhaustive key search for the ISO/IEC standard block cipher PRESENT. Moreover, we observe that an agency having 2^{20} Tesla k20s can capture 80-bit keys that consist of 95 printable ASCII characters in a day on average and an agency with a budget of 250 billion dollars can capture any 80-bit PRESENT key in a month by performing exhaustive search using Geforce GPUs.

URI

https://hdl.handle.net/11511/85518
https://on-demand.gputechconf.com/gtc/2014/poster/pdf/P4192_cryptanalysis_brute_force_attack.pdf

Conference Name

GPU Technology Conference (GTC), (24 - 27 Mart 2014)

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

Modular verification of synchronization with reentrant locks Bultan, Tevfik; Yu, Fang; Betin Can, Aysu (2010-07-28) We present a modular approach for verification of synchronization behavior in concurrent programs that use reentrant locks. Our approach decouples the verification of the lock implementation from the verification of the threads that use the lock. This decoupling is achieved using lock interfaces that characterize the allowable execution order for the lock operations. We use a thread modular verification approach to check that each thread obeys the lock interface. We verify the lock implementation assuming t...
Error Control of MLFMA within a Multiple-Precision Arithmetic Framework Kalfa, Mert; ERTÜRK, VAKUR BEHÇET; Ergül, Özgür Salih (2018-07-13) We present a new error control scheme that provides the truncation numbers as well as the required digits of machine precision for the multilevel fast multipole algorithm (MLFMA). The proposed method is valid for all frequencies, whereas the previous studies on error control are valid only for high-frequency problems. When combined with a multiple-precision arithmetic framework, the proposed method can be used to solve low-frequency problems that would otherwise experience overflow issues. Numerical results...
Error control in MLFMA with multiple-precision arithmetic Kalfa, Mert; Ergül, Özgür Salih; Ertürk, Vakur B. (null; 2018-04-13) We present a new error control method that provides the truncation numbers as well as the required digits of machine precision for the translation operator of the multilevel fast multipole algorithm (MLFMA). The proposed method is valid for all frequencies, whereas the previous studies on error control are valid only for high-frequency problems (i.e., electrically large translation distances). When combined with a multiple-precision implementation of MLFMA, the proposed method can be used to solve low-frequ...
Fast, efficient and dynamically optimized data and hardware architectures for string matching Zengin, Salih; Güran, Hasan Cengiz; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2014) Many fields of computing such as network intrusion detection employ string matching modules (SMM) that search for a given set of strings in their input. An SMM is expected to produce correct outcomes while scanning the input data at high rates. Furthermore, the string sets that are searched for are usually large and their sizes increase steadily. In this thesis, motivated by the requirement of designing fast, accurate and efficient SMMs; we propose a number of SMM architectures that employ Bloom Filters to ...
A Pipelined Camellia Architecture for Compact Hardware Implementation Kavun, Elif Bilge; Yalcin, Tolga (2010-07-09) In this paper, we present a compact and fast pipelined implementation of the block cipher Camellia for 128-bit data and 128-bit key lengths. The implementation is suitable for both Field Programmable Gate Array (FPGA) and Application Specific Integrated Circuit (ASIC) platforms, and is targeted for low area and low power applications. To obtain a compact design, pipelining principles are exploited and platform specific optimizations are made. The design requires only 321 slices with a throughput of 32.96 Mb...

Citation Formats

C. Tezcan and A. Temizel, “Cryptanalysis of PRESENT via CUDA devices,” presented at the GPU Technology Conference (GTC), (24 - 27 Mart 2014), San-Jose, Amerika Birleşik Devletleri, 2014, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/85518.