Results 91 to 100 of about 6,764 (215)

Algebraic properties of generalized Rijndael-like ciphers [PDF]

, 2012
We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field $\GF (p^k)$ ($p\geq 2$ a prime number) is not closed under functional composition.
B. Scott, Cory, Kevin W. Bombardier, L. Babinkostova, Matthew M. Cole, Thomas A   +5 more
core  

Quantum calculi and formalisms for system and network security: A bibliographic insights and synoptic review

IET Quantum Communication, Volume 5, Issue 4, Page 486-515, December 2024.
Quantum calculi and formalisms aid in designing and analysing new cryptographic protocols for blockchain, assessing the feasibility and security of quantum algorithms, and building a quantum‐safe blockchain system. Bibliometric analysis is performed using R language and automated tools to identify key institutions, authors, organisations, and ...
Adarsh Kumar, Mustapha Hedabou, Diego Augusto de Jesus Pacheco   +2 more
wiley   +1 more source

A new S-box pattern generation based on chaotic enhanced logistic map: case of 5-bit S-box

Cybersecurity
Cryptography plays consistently an essential role in securing any sort of communications or data broadcast over the network. Since the security of any designed block cipher algorithm is related to its Substitution box (S-box), several efforts have been ...
Ismail El Gaabouri, Mohamed Senhadji, Mostafa Belkasmi, Brahim El Bhiri   +3 more
doaj   +1 more source

Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes

, 2019
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes.
A Becker, A Nilsson, DJ Bernstein, E Berlekamp, E Eaton, E Prange, H Niederreiter, J Stern, K Kobara, M Baldi, M Baldi, P Santini, PJ Lee, Q Guo, RG Gallager, T Fabšič, T Fabšič   +16 more
core   +1 more source

A Practical Cryptanalysis of the Algebraic Eraser [PDF]

, 2016
15 pages. Updated references, with brief comments added. Minor typos corrected.
Ben-Zvi, Adi, Blackburn, Simon R., Tsaban, Boaz   +2 more
openaire   +2 more sources

Unveiling the Neutral Difference and Its Automated Search

IET Information Security, Volume 2024, Issue 1, 2024.
Given a differential characteristic and an existing plaintext pair that satisfies it (referred to as a right pair), generating additional right pairs at a reduced cost is an appealing prospect. The neutral bit technique, referred to as neutral differences throughout this paper, provides a solution to this challenge.
Guangqiu Lv, Chenhui Jin, Zhen Shi, Ting Cui, Qichun Wang   +4 more
wiley   +1 more source

Automated Differential‐Linear Cryptanalysis for AND‐RX Ciphers

IET Information Security, Volume 2024, Issue 1, 2024.
Differential and linear cryptanalysis are two important methods to evaluate the security of block ciphers. Building on these two methods, differential‐linear (DL) cryptanalysis was introduced by Langford and Hellman in 1994. This cryptanalytic method has been not only extensively researched but also proven to be effective.
Wenya Li, Kai Zhang, Bin Hu, Yong Yu
wiley   +1 more source

Eliminating Variables in Boolean Equation Systems [PDF]

, 2017
Systems of Boolean equations of low degree arise in a natural way when analyzing block ciphers. The cipher's round functions relate the secret key to auxiliary variables that are introduced by each successive round.
Fløystad, Gunnar, Greve, Bjørn Møller, Raddum, Håvard, Ytrehus, Øyvind   +3 more
core   +1 more source

Higher-order differences based research on comparison between type-1 generalized Feistel-SP network and Feistel-SPSP network

Tongxin xuebao, 2014
The powers against the higher-order differential cryptanalysis of the single-SP(substitution-permutation) model and the double-SP model are studied in the type-1 Feistel network by analyzing the growths of algebraic degrees.
ONGLe D, UJiao D, UWen-ling W
doaj   +2 more sources

MRHS solver based on linear algebra and exhaustive search

Journal of Mathematical Cryptology, 2018
We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj   +1 more source