Sycon: a new milestone in designing ASCON-like permutations

Mandal, Kalikinkar; Saha, Dhiman; Sarkar, Sumanta; Todo, Yosuke

doi:10.1007/s13389-021-00272-9

Cited by 8 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results indicate that the SAC and BIC criteria are suboptimal. In addition, we analyzed several 5×5 S-Boxes used in algorithms such as [48]- [51] and found that the BIC and SAC parameters were suboptimal. Several characteristics related to the SCA resistance ability of these S-Boxes are insufficient.…”

Section: A Related Workmentioning

confidence: 99%

“…The average nonlinearity of a 5×5 S-Box is 10. The comparison results in Table 8 show that the proposed 5×5 S-Box has an average nonlinearity value lower than that of the PRIMATE/FIDES [48], [49] S-Box and greater than that of the remaining S-Boxes such as ASCON [31], THAKOR [32], ICEPOLE [50], and SYCON [51]. 8.0 0.2500 0.250 THAKOR [32] 8.4 0.2500 0.250 IRFAN [33] 8.8 0.2500 0.250 PRIMATE [48], FIDES [49] 12.0 0.0625 0.125 ICEPOLE [50] 8.0 0.2500 0.250 SYCON [51] 8.0 0.2500 0.250 IRFAN [33] 8.8 0.2500 0.250 Ideal value High Low Low…”

Section: A Nonlinearitymentioning

confidence: 99%

See 1 more Smart Citation

Construction of Robust Lightweight S-Boxes Using Enhanced Logistic and Enhanced Sine Maps

Duong,

Minh Nguyen,

Dao

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Substitution boxes (S-Boxes) are essential elements of modern block ciphers, serving as nonlinear characteristics that enhance the resistance of these ciphers against cryptanalysis. This research presents a new approach for constructing lightweight S-Boxes that possess strong cryptographic characteristics by combining an enhanced logistic map and an enhanced sine map. The proposed novel algorithm has optimized multiple parameters according to the security threshold set. This study has conducted the most comprehensive evaluation of criteria for S-Boxes to date. The analysis results of the generated 4×4 and 5×5 S-Boxes have achieved optimal criteria in terms of the Strict Avalanche Criterion (SAC) and the Bit Independence Criterion (BIC) that no previous S-Boxes have achieved. Furthermore, parameters related to side-channel attack resistance have been optimized in the design stage of S-Boxes. The constructed S-Boxes with high security can be applied to replace S-Boxes of the same size in existing algorithms or to develop lightweight block cipher algorithms. This research has made a significant contribution to the construction of S-Boxes.INDEX TERMS S-Box, logistic map, sine map, chaotic map. side-channel attacks.

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: A Nonlinearitymentioning

confidence: 99%

Construction of Robust Lightweight S-Boxes Using Enhanced Logistic and Enhanced Sine Maps

Duong,

Minh Nguyen,

Dao

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Sycon is an authenticated encryption with an associated data (AEAD) cipher [22]. AEAD is an encryption algorithm with a built-in integrity process using a secret key [23].…”

Section: Sycon Authenticated Encryption With the Associated Data Algo...mentioning

confidence: 99%

A Cube Attack on a Reduced-Round Sycon

et al. 2022

View full text Add to dashboard Cite

The cube attack was proposed at the 2009 Eurocrypt. The attack derives linear polynomials for specific output bits of a BlackBox cipher. Cube attacks target recovery keys or secret states. In this paper, we present a cube attack on a 5-round Sycon permutation and a 6-round Sycon permutation with a 320-bit state, whose rate occupies 96 bits, and whose capacity is 224 bits. We found cube variables related to a superpoly with a secret state. Within the cube variables, we recovered 32 bits of the secret state. The target algorithm was Sycon with 5-round and 6-round versions of permutation. For the 5-round Sycon, we found a cube variable and recovered a state with a total of 2192 Sycon computations and 237 bits of memory. For the 6-round Sycon, we found cube variables and recovered a state with a total of 2192 Sycon computations and 270 bits of memory. When using brute force in a 5-round attack, 2224 operations were required, but the cube attack proposed in this paper had 248 offline operations, and 232 operations were required. When using brute force in a 6-round attack, 2224 operations were required, but the cube attack proposed in this paper required 295 offline operations, and 263 operations were required. For both attacks, offline could be used continuously after performing only once. To the best of our knowledge, this is the first cube attack on Sycon.

show abstract

“…One approach to design lightweight SPNs would be to apply lightweight S-boxes and lightweight diffusion matrices. There have been different approaches for constructing lightweight S-boxes, for instance, GIFT [BPP + 17] has an extremely lightweight 4 × 4 S-box, Sycon [MSST22] has a lightweight 5 × 5 S-box, and [CDL15] showed a way to construct lightweight S-boxes using Feistel and MISTY structures.…”

Section: Introductionmentioning

confidence: 99%

On the Lower Bound of Cost of MDS Matrices

Venkateswarlu

Kesarwani²,

Sarkar³

2022

ToSC

View full text Add to dashboard Cite

Ever since lightweight cryptography emerged as one of the trending topics in symmetric key cryptography, optimizing the implementation cost of MDS matrices has been in the center of attention. In this direction, various metrics like d-XOR, s-XOR and g-XOR have been proposed to mimic the hardware cost. Consequently, efforts also have been made to search for the optimal MDS matrices for dimensions relevant to cryptographic applications according to these metrics. However, finding the optimal MDS matrix in terms of hardware cost still remains an unsolved problem. In this paper, we settle the question of the optimal 4 x 4 MDS matrices over GL(n, F2) under the recently proposed metric sequential XOR count based on words (sw-XOR). We prove that the sw-XOR of such matrices is at least 8n + 3, and the bound is tight as matrices with sw-XOR cost 35 and 67 for the values of n = 4 and 8, respectively, were already known. Moreover, the lower bound for these values of n matches with the known lower bounds according to s-XOR and g-XOR metrics.

show abstract

Sycon: a new milestone in designing ASCON-like permutations

Cited by 8 publications

References 28 publications

Construction of Robust Lightweight S-Boxes Using Enhanced Logistic and Enhanced Sine Maps

Construction of Robust Lightweight S-Boxes Using Enhanced Logistic and Enhanced Sine Maps

A Cube Attack on a Reduced-Round Sycon

On the Lower Bound of Cost of MDS Matrices

Contact Info

Product

Resources

About