Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Codes and Provable Security of Ciphers
View through CrossRef
While the design of block ciphers that are provably secure against all attacks, still eludes us, it is possible to make designs that resist differential and linear cryptanalysis, which are two very important general methods of cryptanalysis on symmetric algorithms. The Wide Trail design strategy allows to construct ciphers for which it is very easy to prove security against differential cryptanalysis. This is possible by choosing linear maps for which it is easy to show lower bounds on the number of active S-boxes. These linear maps can be derived from MDS codes in order to obtain the best possible diffusion. The same methods can be used to obtain provable security against linear cryptanalysis, in particular when linear cryptanalysis is defined in terms of the trace map.
Title: Codes and Provable Security of Ciphers
Description:
While the design of block ciphers that are provably secure against all attacks, still eludes us, it is possible to make designs that resist differential and linear cryptanalysis, which are two very important general methods of cryptanalysis on symmetric algorithms.
The Wide Trail design strategy allows to construct ciphers for which it is very easy to prove security against differential cryptanalysis.
This is possible by choosing linear maps for which it is easy to show lower bounds on the number of active S-boxes.
These linear maps can be derived from MDS codes in order to obtain the best possible diffusion.
The same methods can be used to obtain provable security against linear cryptanalysis, in particular when linear cryptanalysis is defined in terms of the trace map.
Related Results
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang
Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
On Statistical Testing of Block Ciphers
On Statistical Testing of Block Ciphers
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in development of block ciphers, like any other cryptographic algorithms, is the analy...
An efficient permutation approach for SbPN-based symmetric block ciphers
An efficient permutation approach for SbPN-based symmetric block ciphers
AbstractIt is challenging to devise lightweight cryptographic primitives efficient in both hardware and software that can provide an optimum level of security to diverse Internet o...
Practical Attacks of Round-Reduced SIMON Based on Deep Learning
Practical Attacks of Round-Reduced SIMON Based on Deep Learning
Abstract
At CRYPTO’19, Gohr built a bridge between deep learning and cryptanalysis. Based on deep neural networks, he trained neural distinguishers of SPECK32/64. Be...
Development Tasks of AI-based Security Industry
Development Tasks of AI-based Security Industry
Recently, the government's interest in industries utilizing AI has been amplified, with initiatives such as announcing a roadmap aiming to achieve the goal of becoming the world's ...
Provability logic
Provability logic
Central to Gödel’s second incompleteness theorem is his discovery that, in a sense, a formal system can talk about itself. Provability logic is a branch of modal logic specifically...
Low Correlation Codes for Sonar Systems
Low Correlation Codes for Sonar Systems
<p>Sonar is a vital technology for the detection of objects in the water. Sonarsystems have been redefined over many decades, but research is still beingconducted into optima...
Accelerating the Best Trail Search on AES-Like Ciphers
Accelerating the Best Trail Search on AES-Like Ciphers
In this study, we accelerate Matsui’s search algorithm to search for the best differential and linear trails of AES-like ciphers. Our acceleration points are twofold. The first exp...