Differential-linear Attacks on Permutation Ciphers Revisited: Experiments on Ascon and DryGASCON

Date

2021-01-01

Author

Civek, Aslı Başak
Tezcan, Cihangir

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

190
views

0
downloads

Ascon and DryGASCON are very similar designs that were submitted to NIST's lightweight cryptography standardization process. While Ascon made it to the finals, DryGASCON was eliminated in the second round. We analyze these algorithms against truncated, linear and differential-linear distinguishers to compare their security. We correct 2, 3, 3.5-round truncated differentials and 5-round differential-linear distinguishers that were given for DryGASCON-128. Moreover, we provide the longest practical differential-linear distinguisher of DryGASCON-128. Finally, we compare the security of Ascon-128 and DryGASCON-128 against differential-linear cryptanalysis.

Subject Keywords

Lightweight Cryptography, Cryptanalysis, Differential-linear Analysis, NIST

URI

https://hdl.handle.net/11511/99107

DOI

https://doi.org/10.5220/0010982600003120

Conference Name

8th International Conference on Information Systems Security and Privacy (ICISSP)

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

Differential-linear cryptanalysis of ascon and drygascon Civek, Aslı Başak; Tezcan, Cihangir; Department of Cybersecurity (2021-6) Due to rapidly developing technology, devices have become smaller along with their performance capacity and memory. If possible, existing NIST-approved encryption standards should be used on these resource-constrained devices. When an acceptable performance cannot be achieved in this way, there is a need for more lightweight algorithms. Since taking individual measures leads to simplistic designs when designing lightweight algorithms, ciphers can become more vulnerable to cryptographic attacks. Hence some r...
Mutual correlation of NIST statistical randomness tests and comparison of their sensitivities on transformed sequences Doğanaksoy, Ali; Uğuz, Muhiddin; Akcengiz, Ziya (2017-01-01) Random sequences are widely used in many cryptographic applications and hence their generation is one of the main research areas in cryptography. Statistical randomness tests are introduced to detect the weaknesses or nonrandom characteristics that a sequence under consideration may have. In the literature, there exist various statistical randomness tests and test suites, defined as a collection of tests. An efficient test suite should consist of a number of uncorrelated statistical tests each of which meas...
Modular exponentiation methods in cryptography Yünüak, Hasan Bartu; Cenk, Murat; Department of Cryptography (2017) Modular exponentiation has an important role in many cryptographic algorithms. These exponentiation methods differ in the bases used and their representations, the repeating aspect, and for which algorithms they are used for: fixed or variable base. Our research aims to compare the efficiencies and implementation timings for some selected algorithms. Also, we look at the options for using a dedicated cubing algorithm, and compare them with the current algorithms.
Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT Ozen, Onur; Varici, Kerem; Tezcan, Cihangir; Kocair, Celebi (2009-07-03) Design and analysis of lightweight block ciphers have become more popular due to the fact that the future use of block ciphers in ubiquitous devices is generally assumed to be extensive. In this respect, several lightweight block ciphers are designed, of which PRESENT and HIGHT are two recently proposed ones by Bogdanov et al. and Hong et al. respectively. In this paper, we propose new attacks on PRESENT and HIGHT. Firstly, we present the first related-key cryptanalysis of 128-bit keyed PRESENT by introduci...
Analyzes of Block Recombination and Lazy Interpolation Methods and Their Applications to Saber Aksoy, Berkin; Cenk, Murat; Department of Cryptography (2022-2-28) Since the beginning of the National Institute of Standards and Technology (NIST), The Post-Quantum Cryptography (PQC) Standardization Process, efficient implementations of lattice-based algorithms have been studied extensively. Lattice-based NIST PQC finalists use polynomial or matrix-vector multiplications on the ring with type {Z}_{q}[x] / f(x). For convenient ring types, Number Theoretic Transform (NTT) can be used to perform multiplications as done in Crystals-KYBER among the finalists of the NIST PQC S...

Citation Formats

A. B. Civek and C. Tezcan, “Differential-linear Attacks on Permutation Ciphers Revisited: Experiments on Ascon and DryGASCON,” presented at the 8th International Conference on Information Systems Security and Privacy (ICISSP), ELECTR NETWORK, 2021, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/99107.