Differential Fault Intensity Analysis on PRESENT and LED Block Ciphers

2015 ◽  
pp. 174-188 ◽  
Author(s):  
Nahid Farhady Ghalaty ◽  
Bilgiday Yuce ◽  
Patrick Schaumont
Keyword(s):  
Block Ciphers ◽  
Intensity Analysis

Penentuan Metode Intensitas Hujan Berdasarkan Karakteristik Hujan dari Stasiun Pengamat Hujan Disekitar Kecamatan Karawang Timur

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Melisa Permatasari ◽  
M. Candra Nugraha ◽  
Etih Hartati
Keyword(s):  
Drainage System ◽  
Daily Rainfall ◽  
Intensity Analysis ◽  
Rain Intensity ◽  
Rainy Period ◽  
Discharge Plan ◽  
Calculation Results ◽  
Value Determination ◽  
Maximum Daily Rainfall ◽  
Method Approach

<p>The rain intensity is the high rainfall in unit of time. The length of rain will be reversed by the amount rain intensity. The shorter time the rain lasts, the greater of the intensity and re-period of its rain. The value of rain intensity is required to calculate the flood discharge plan on the drainage system planning area in East Karawang district. Determining the value rain intensity is required the maximum daily rainfall data obtained from the main observer stations in the Plawad station planning area. The method of determination rain intensity analysis can be done with three methods: Van Breen, Bell Tanimoto and Hasper der Weduwen. Selected method is based on the smallest deviation value. Determination deviation value is determined by comparing rain intensity value of Van Breen method, Bell Tanimoto, Hasper der Weduwen. By comparing rain intensity value of the Van Breen method, Bell Tanimoto, Hasper der Weduwen with the results of calculating three methods through the method approach Talbot, Sherman and Ishiguro. Calculation results show that the method of rain has smallest deviation standard is method Van Breen with Talbot approach for rainy period (PUH) 2, 5, 10, 25, 50 and 100 years.</p>

Hash Functions Based on Block Ciphers

2009 ◽  
Vol 20 (3) ◽  
pp. 682-691
Author(s):  
Pin LIN ◽  
Wen-Ling WU ◽  
Chuan-Kun WU
Keyword(s):  
Hash Functions ◽  
Block Ciphers

A New Statistical Test on Block Ciphers

2009 ◽  
Vol 32 (4) ◽  
pp. 595-601 ◽  
Author(s):  
Hua CHEN ◽  
Deng-Guo FENG ◽  
Li-Min FAN
Keyword(s):  
Block Ciphers ◽  
Statistical Test

Architectural Supports for Block Ciphers in a RISC CPU Core by Instruction Overloading

2021 ◽  
pp. 1-1
Author(s):  
Piljoo Choi ◽  
Wonbae Kong ◽  
Ji-Hoon Kim ◽  
Mun-Kyu Lee ◽  
Dong Kyue Kim
Keyword(s):  
Block Ciphers

scholarly journals Six shades lighter: a bit-serial implementation of the AES family

2021 ◽  
Author(s):  
Sergio Roldán Lombardía ◽  
Fatih Balli ◽  
Subhadeep Banik
Keyword(s):  
Block Cipher ◽  
Block Ciphers ◽  
Authenticated Encryption ◽  
Current Standard ◽  
Asic Circuit ◽  
The Family ◽  
Encryption And Decryption ◽  
Preliminary Version ◽  
Reduction In Area ◽  
Bit Serial

AbstractRecently, cryptographic literature has seen new block cipher designs such as , or that aim to be more lightweight than the current standard, i.e., . Even though family of block ciphers were designed two decades ago, they still remain as the de facto encryption standard, with being the most widely deployed variant. In this work, we revisit the combined one-in-all implementation of the family, namely both encryption and decryption of each as a single ASIC circuit. A preliminary version appeared in Africacrypt 2019 by Balli and Banik, where the authors design a byte-serial circuit with such functionality. We improve on their work by reducing the size of the compact circuit to 2268 GE through 1-bit-serial implementation, which achieves 38% reduction in area. We also report stand-alone bit-serial versions of the circuit, targeting only a subset of modes and versions, e.g., and . Our results imply that, in terms of area, and can easily compete with the larger members of recently designed family, e.g., , . Thus, our implementations can be used interchangeably inside authenticated encryption candidates such as , or in place of .

scholarly journals Efficient Implementation of PRESENT and GIFT on Quantum Computers

2021 ◽  
Vol 11 (11) ◽  
pp. 4776
Author(s):  
Kyungbae Jang ◽  
Gyeongju Song ◽  
Hyunjun Kim ◽  
Hyeokdong Kwon ◽  
Hyunji Kim ◽  
...  
Keyword(s):  
Block Cipher ◽  
Search Algorithm ◽  
Block Ciphers ◽  
Quantum Circuits ◽  
Security Level ◽  
Symmetric Key ◽  
Grover Search ◽  
Target Block ◽  
Symmetric Key Cryptography ◽  
Grover Search Algorithm

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

Sign in / Sign up

Export Citation Format

Share Document