scholarly journals Generalized differential-linear cryptanalysis of block cipher

Radiotekhnika ◽  
2021 ◽  
pp. 5-15
Author(s):  
A.N. Alekseychuk
Keyword(s):  
Block Cipher ◽  
Block Ciphers ◽  
Linear Cryptanalysis ◽  
Information Complexity ◽  
The Matrix ◽  
First Results ◽  
Scientific Substantiation ◽  
The Subject ◽  
Linear Attack ◽  
Generalized Differential

Differential-linear cryptanalysis of block ciphers was proposed in 1994. It turns out to be more efficient in comparison with (separately) differential and linear cryptanalytic methods, but its scientific substantiation remains the subject of further research. There are several publications devoted to formalization of differential-linear cryptanalysis and clarification of the conditions under which its complexity can be mathematically accurately assessed. However, the problem of the differential-linear cryptanalytic method substantiation remains completely unresolved. This paper  presents first results obtained by the author in the direction of solving this problem. The class of differential-linear attacks on block ciphers is expanded. Namely, both distinguishing attacks and attacks aimed at recovering one bit of information about a key are considered. In this case, no assumptions are made (as in well-known publications) about the possibility of representing the cipher in the form of some two components. Lower bounds of information complexity of these attacks are obtained. The expressions of these bounds depend on the averaged (by keys) values of the elements’ squares of the generalized autocorrelation table of the encryption transformation. In contrast to the known ones, the obtained bounds are not based on any heuristic assumptions about the investigated block ciphers and are valid for a wider class of attacks as compared to the traditional differential-linear attack. Relations between, respectively, differential, linear and differential-linear properties of bijective Boolean mappings are given. In contrast to the well-known works, the matrix form of the relations is used that makes it possible to clarify better their essence and simplify the proofs. A new relation is derived for the elements of the generalized autocorrelation table of the encryption transformation of the product of two block ciphers, which may be useful in further research.

scholarly journals Crypto-Archaeology: unearthing design methodology of DES s-boxes

2017 ◽  
Author(s):  
Sankhanil Dey ◽  
Ranjan Ghosh
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Design Methodology ◽  
Block Cipher ◽  
Block Ciphers ◽  
Public Domain ◽  
Differential Cryptanalysis ◽  
Linear Cryptanalysis ◽  
Strict Avalanche Criterion ◽  
Independence Criterion

US defence sponsored the DES program in 1974 and released it in 1977. It remained as a well-known and well accepted block cipher until 1998. Thirty-two 4-bit DES S-Boxes are grouped in eight each with four and are put in public domain without any mention of their design methodology. S-Boxes, 4-bit, 8-bit or 32-bit, find a permanent seat in all future block ciphers. In this paper, while looking into the design methodology of DES S-Boxes, we find that S-Boxes have 128 balanced and non-linear Boolean Functions, of which 102 used once, while 13 used twice and 92 of 102 satisfy the Boolean Function-level Strict Avalanche Criterion. All the S-Boxes satisfy the Bit Independence Criterion. Their Differential Cryptanalysis exhibits better results than the Linear Cryptanalysis. However, no S-Boxes satisfy the S-Box-level SAC analyses. It seems that the designer emphasized satisfaction of Boolean-Function-level SAC and S-Box-level BIC and DC, not the S-Box-level LC and SAC.

scholarly journals Zero-Correlation Linear Cryptanalysis on SPARX-64

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Dawei Zhou ◽  
Huaifeng Chen ◽  
Rui Zong ◽  
Ningning Song
Keyword(s):  
Block Ciphers ◽  
Third Party ◽  
Linear Cryptanalysis ◽  
Multiple Zero ◽  
Zero Correlation ◽  
Linear Attack ◽  
Attack Models

SPARX is a family of ARX-based block ciphers designed according to the long-trail strategy, which has 32-bit ARX-based SBoxes and has provable bounds against single-differential and single-linear cryptanalysis. Since its proposation, some third-party cryptanalysis methods have been presented. As far as we know, the best attacks against SPARX-64 covered 16 (out of 24) rounds. In this paper, we propose zero-correlation linear attacks on SPARX-64. At first, we construct some new zero-correlation linear distinguishers covering 14-round and 15-round SPARX-64. Then, 15,16,17 and 18-round versions can be attacked using multidimensional or multiple zero-correlation linear attack models, under DKP(distinct known plaintexts) settings. These are the best attacks against SPARX-64 up to now, regarding to the number of attacked rounds. Finally, we transform the zero-correlation distinguishers into integral ones using existing methods, which are also longer than the ones proposed by the designers.

Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256

2017 ◽  
Vol 11 (2) ◽  
Author(s):  
Massoud Hadian Dehkordi ◽  
Roghayeh Taghizadeh
Keyword(s):  
Block Cipher ◽  
Advanced Encryption Standard ◽  
Linear Cryptanalysis ◽  
Data Complexity ◽  
Zero Correlation ◽  
Key Block ◽  
Symmetric Key ◽  
Linear Attack

AbstractCAST-256 (or CAST6) is a symmetric-key block cipher published in June 1998. It was submitted as a candidate for Advanced Encryption Standard (AES). In this paper, we will propose a new chosen text attack, the multiple differential-zero correlation linear attack, to analyze the CAST-256 block cipher. Our attack is the best-known attack on CAST-256 according to the number of rounds without the weak-key assumption. We first construct a 30-round differential-zero correlation linear distinguisher. Based on the distinguisher, we propose a first 33-round attack on CAST-256 with data complexity of

scholarly journals Crypto-Archaeology: unearthing design methodology of DES s-boxes

2017 ◽  
Author(s):  
Sankhanil Dey ◽  
Ranjan Ghosh
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Design Methodology ◽  
Block Cipher ◽  
Block Ciphers ◽  
Public Domain ◽  
Differential Cryptanalysis ◽  
Linear Cryptanalysis ◽  
Strict Avalanche Criterion ◽  
Independence Criterion

US defence sponsored the DES program in 1974 and released it in 1977. It remained as a well-known and well accepted block cipher until 1998. Thirty-two 4-bit DES S-Boxes are grouped in eight each with four and are put in public domain without any mention of their design methodology. S-Boxes, 4-bit, 8-bit or 32-bit, find a permanent seat in all future block ciphers. In this paper, while looking into the design methodology of DES S-Boxes, we find that S-Boxes have 128 balanced and non-linear Boolean Functions, of which 102 used once, while 13 used twice and 92 of 102 satisfy the Boolean Function-level Strict Avalanche Criterion. All the S-Boxes satisfy the Bit Independence Criterion. Their Differential Cryptanalysis exhibits better results than the Linear Cryptanalysis. However, no S-Boxes satisfy the S-Box-level SAC analyses. It seems that the designer emphasized satisfaction of Boolean-Function-level SAC and S-Box-level BIC and DC, not the S-Box-level LC and SAC.

Microdiffraction analysis of precipitate crystallography and morphology in Al alloys

1990 ◽  
Vol 48 (4) ◽  
pp. 954-955
Author(s):  
B.C. Muddle ◽  
G.R. Hugo
Keyword(s):  
Point Group ◽  
Hexagonal Lattice ◽  
Intersection Point ◽  
Saed Pattern ◽  
Point Symmetry ◽  
Hexagonal Symmetry ◽  
Precipitate Crystal ◽  
The Matrix ◽  
The Subject ◽  
Electron Microdiffraction

Electron microdiffraction has been used to determine the crystallography of precipitation in Al-Cu-Mg-Ag and Al-Ge alloys for individual precipitates with dimensions down to 10 nm. The crystallography has been related to the morphology of the precipitates using an analysis based on the intersection point symmetry. This analysis requires that the precipitate form be consistent with the intersection point group, defined as those point symmetry elements common to precipitate and matrix crystals when the precipitate crystal is in its observed orientation relationship with the matrix.In Al-Cu-Mg-Ag alloys with high Cu:Mg ratios and containing trace amounts of silver, a phase designated Ω readily precipitates as thin, hexagonal-shaped plates on matrix {111}α planes. Examples of these precipitates are shown in Fig. 1. The structure of this phase has been the subject of some controversy. An SAED pattern, Fig. 2, recorded from matrix and precipitates parallel to a <11l>α axis is suggestive of hexagonal symmetry and a hexagonal lattice has been proposed on the basis of such patterns.

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.

WALIS - Towards a global database of Last Interglacial sea-level proxies.

2021 ◽  
Author(s):  
Alessio Rovere ◽  
Deirdre Ryan ◽  
Matteo Vacchi ◽  
Alexander Simms ◽  
Andrea Dutton ◽  
...  
Keyword(s):  
Sea Level ◽  
Research Council ◽  
Geological Data ◽  
Sea Level Changes ◽  
Last Interglacial ◽  
Global Database ◽  
The World ◽  
First Results ◽  
Data Points ◽  
The Subject

&lt;p&gt;The standardization of geological data, and their compilation into geodatabases, is essential to allow more coherent regional and global analyses. In sea-level studies, the compilation of databases containing details on geological paleo sea-level proxies has been the subject of decades of work. This was largely spearheaded by the community working on Holocene timescales. While several attempts were also made to compile data from older interglacials, a truly comprehensive approach was missing. Here, we present the ongoing efforts directed to create the World Atlas of Last Interglacial Shorelines (WALIS), a project spearheaded by the PALSEA (PAGES/INQUA) community and funded by the European Research Council (ERC StG 802414). The project aims at building a sea-level database centered on the Last Interglacial (Marine Isotope Stage 5e, 125 ka), a period of time considered as an &quot;imperfect analog&quot; for a future warmer climate. The database is composed of 17 tables embedded into a mySQL framework with a total of more than 500 single fields to describe several properties related to paleo sea-level proxies, dated samples and metadata. In this presentation, we will show the first results of the global compilation, which includes nearly 2000 data points and will discuss its relevance in answering some of the most pressing questions related to sea-level changes in past warmer worlds.&amp;#160;&lt;/p&gt;

scholarly journals Prueba cognitiva–cuantitativa para identificar el Acercamiento Comunicativo Dialógico Textual del docente

2016 ◽  
pp. 45-74
Author(s):  
Mtra. Claudia Flores Cervantes ◽  
Dra. Alma Alicia Benítez Pérez
Keyword(s):  
Reading Comprehension ◽  
Knowledge Acquisition ◽  
Scientific Knowledge ◽  
Teaching Staff ◽  
Scientific Texts ◽  
Quantitative Test ◽  
First Results ◽  
The Subject ◽  
Probabilistic Diagnosis ◽  
Cognitive Dimensions

Este artículo tiene como objetivo proponer una prueba cognitiva–cuantitativa para identificar el Acercamiento Comunicativo Dialógico Textual en el docente de nivel medio superior con relación al texto científico, a partir de la elaboración de una rúbrica integrada por categorías (dimensiones cognitivas) y niveles de comprensión de lectura, al tiempo de ser una base para la elaboración de ítems. Actualmente la prueba se encuentra en etapa diagnóstica y es de corte cuantitativo no probabilístico. Los primeros resultados señalan que sí es posible identificar el ACDT, justo donde la decodificación que realiza el sujeto sobre el objeto textual, determina la profundidad del diálogo y la adquisición del conocimiento científico en torno al mensaje. AbstractThe objective of this article is to propose a cognitive–quantitative test to identify the Dialogic–Textual Communicative Approach Of the upper middle education's teaching staff about scientific texts, from a rubric integrated by categories (cognitive dimensions) and reading comprehension levels. It's important to mention that this rubric was also used to elaborate the items. Currently the test is on a quantitative not probabilistic diagnosis stage. The first results conclude that certainly the ACDT, can be identifiable, where the decoding that the subject is doing about the textual object, determines the depth of the dialogue and the scientific knowledge acquisition about the message. Recibido: 17 de agosto de 2015 Aceptado: 01 de marzo de 2016

Sign in / Sign up

Export Citation Format

Share Document