Customizable sponge-based authenticated encryption using 16-bit S-boxes

Kelly, Matthew; Kaminsky, Alan; Kurdziel, Michael; Lukowiak, Marcin; Radziszowski, Stanisław

doi:10.1109/milcom.2015.7357416

Cited by 13 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The complexity in one round may increase if the component size is increased. Therefore, large-size components are required for secure and efficient encryption while reducing rounds [1]- [5]. However, the security measurement becomes more complicated as the size of components increases.…”

Section: Introductionmentioning

confidence: 99%

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

2022

View full text Add to dashboard Cite

The substitution box (S-box) is one of the major components of cryptographic algorithms. An important issue for cryptographic algorithm designers in ensuring sufficient security from linear cryptanalysis, one of the most powerful attacks, is finding an S-box with a sufficiently low linear spectrum. However, to the best of our knowledge, most of the published S-box analysis tools cannot generate linear approximation tables for large S-boxes, such as 16-bit S-boxes. Even tools that support the generation of 16-bit linear approximation tables using parallel processing, such as Eval16BitSbox, require a long time. We used bitslice, which can efficiently process bitwise operations in parallel by taking advantage of independent operations, for generating a linear approximation table. In this study, the linear approximation table generation method implemented using the element unit operation of the existing S-box was upgraded to a vector unit operation in a bitslice manner. This improved method enabled the immediate creation of tables, even for 16-bit Sboxes. This approach allows cryptographic algorithm designers to consider a wider variety of S-boxes. INDEX TERMS Large size S-box, Bitsliced implementation, Linear approximation Table21each round. When using an S-box for a nonlinear function, 22 this attack uses a difference distribution table (DDT) of the S-23 box. The DDT is a chart of how often a difference in the input 24 bit makes a difference in the output bit. Linear cryptanalysis 25 uses an equation generated by a linear approximation of 26 the relationship between the input and output bits of the S-27 box. Such an approximation can be achieved using a linear 28 approximation table (LAT) of the S-box. 29 Cryptanalysis largely utilizes these two tables. Finding an 30 S-box for which both properties are secure is therefore an 31 important issue for cryptographic algorithm designers. S-32 box analysis tools, such as PEIGEN, SAGE, SET, BSAT, 33 etc., generally provide facilities for the generation of DDT 34 and LAT [12]-[15]. However, as the bit size of the S-box 35 grows to around 16 bits, most tools do not support LAT 36 generation, or the generation process is not finished. In the 37 most widely used table generation method for an n-bit S-box, 38 2 2n computations are required to generate the DDT, and 2 3n 39 computations are required to generate the LAT. Hence, for

show abstract

Section: Introductionmentioning

confidence: 99%

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

2022

View full text Add to dashboard Cite

show abstract

“…There are different designs of sponge structure [4] as SpongeWrap [5], APE [6], CBEAM [7], Sp-AELM [8], Lsap [9], Beetle [10], Spookchain [11], T-sponge [12], TETsponge [13], CTR [14], ISAP [15], Beetle [16], Cyclist [17], Duplex [19,20].…”

Section: Related Workmentioning

confidence: 99%

“…Cyclist [17,18] investigated Inverse-free, single-pass, Lightweight, and RUP Security functional features only. Duplex [19] investigated Inverse-free functional feature only.…”

Section: Related Workmentioning

confidence: 99%

Design a Lightweight Authentication Encryption Based on Stream Cipher and Chaotic Maps with Sponge Structure for Internet of Things Applications

2023

IJIES

View full text Add to dashboard Cite

The design of a cipher system is essential and required with the development of the technology era. The internet of things concept is modern technology requiring lightweight, secure algorithms to investigate the requirement of the light device. Furthermore, IoT devices have limited resources (IoT devices should minimize battery life, limited memory size, and response time). A stream cipher system is faster than a block cipher system and has an easy feature with hardware and software implementation. This paper designs a lightweight authentication encryption algorithm based on stream cipher and chaotic maps with sponge structure for IoT applications. Currently, the suggested approach uses text data for encryption and authorization. Additionally, the suggested algorithm will be able to use it with image data in the future. Analysis results of the proposed algorithm based on NIST randomness tests, execution time, memory space, and functional features. The results are compared with other previous works which used sponge structure (e.g. Ascon, Elephant, ISAP, Photon-Beetle, and Xoodyak, etc.). Randomness tests show that the proposed system is random and secure with investigate all the functional features except the parallelization feature which will work it in the future. And also it has good fast speed and less memory space.

show abstract

“…Each absorbed r-bit plaintext block M i is used to produce one ciphertext block CT i , and the authentication tag T is outputted at the end. The details of permutation f , each round operation and overall security analysis are described in [1], [2], [10].…”

Section: A Mk-3 Authenticated Encryption Algorithmmentioning

confidence: 99%

Array-Based Statistical Analysis of the MK-3 Customizable Authenticated Encryption Algorithm

Bajorski,

Kaminsky,

Kurdziel

et al. 2023

Preprint

View full text Add to dashboard Cite

To provide security autonomy capability, such that different users can have independent variants of the encryption algorithm, MK-3 is designed to be customizable. Two levels of customization are supported, Factory Customization and Field Customization. Customization is done by modifying functions and function parameters in the algorithm to yield unique cipher functions while preserving the algorithm’s cryptographic security. The main goal of this work is to present the results from the statistical analysis of the customizable MK-3 encryption cypher, focusing on field customized mixers. We recall the main components of the MK-3 algorithm and overview a subset of available factory and field customizations for MK-3. We test the main instances of the field customized versions and give a general argument for their desired statistical properties expected from an encryption cypher.

show abstract

Customizable sponge-based authenticated encryption using 16-bit S-boxes

Cited by 13 publications

References 10 publications

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

Speeding Up LAT: Generating a Linear Approximation Table Using a Bitsliced Implementation

Design a Lightweight Authentication Encryption Based on Stream Cipher and Chaotic Maps with Sponge Structure for Internet of Things Applications

Array-Based Statistical Analysis of the MK-3 Customizable Authenticated Encryption Algorithm

Contact Info

Product

Resources

About