A Novel Method of Creating Block Ciphers Provably Immune to Linear and Differential Cryptanalysis
Overview
It is often the case that the size of some data is fixed and it might be encrypted all at once. Currently, in such a situation, we use a stream cipher or a block cipher with some mode of operation which has to be implemented additionally. Both of these options require storing additional information such as an IV, a nonce or a MAC, which might be a significant part of the data, if the data size is small. Unfortunately, up to now, ciphers with a larger block size have required a larger diffusion layer, which have taken up a lot of memory and made the cipher implementation harder. In this study a new method of constructing block ciphers is proposed. The presented construction consists of parallel SP-networks which recursively interchange data using a small diffusion layer, the size of which is recursively doubled by a presented algorithm. The method enables the creation of ciphers provably resistant to linear and differential cryptanalysis. These would be easy to parallelize and would make it possible to use a small, easy to store diffusion layer. The minimum required number of rounds for this method is derived. A proof is conducted, so that every encryption algorithm created using this method is resistant to linear and differential cryptanalysis under the given minimum required number of rounds.
Awards (3)
- King Abdulaziz & his Companions Foundation for Giftedness and Creativity: On-line Mawhiba Universal Enrichment Program
- King Abdulaziz & his Companions Foundation for Giftedness and Creativity: Award of $500 $500
- Association for Computing Machinery: Second Award of $3,000 $3,000
Competition history
- ISEF 2021
Resources
Related projects
ISEF · 2018
A Practical Cryptosystem with Provable Security: Three New Innovations in Cryptography
ISEF · 2014
Modifying the One-Time Pad Cryptosystem for Practical Use
ISEF · 2019
Hash Chaining: A Theoretical Model Using Salted Hashes to Generate Ethereal Keys
ISEF · 2017
Novel Application of Collatz-like Sequences to Cryptographically Secure Pseudo-Random Number Generation
ISEF · 2015
Parallel Implementation of the Convolution Operation in Quotient Polynomial Rings for the NTRU Cryptosystem
ISEF · 2022
Novel Search Algorithms To Efficiently Solve the Shortest Vector Problem in Post-Quantum Cryptography
ISEF · 2014
A New Secure Distributed Storage System for Cloud: Mathematical Framework, Design and Applications
ISEF · 2024
A Novel Approach for Analyzing the Cipher Algorithms of the Advanced Encryption Standard (AES) and Developing a New Quantum Algorithm in the Era of Quantum Computing and Quantum Cybersecurity
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair