Results 61 to 70 of about 6,728,968 (223)

Distinguishing attack on five-round Feistel networks

Electronics Letters, 2003
Recently it was shown (by J. Patarin) how to distinguish a general five-round Feistel network from a random permutation using (23n/2) chosen plaintexts or (27n/4) known plaintexts. The present authors report improvement of these results and a distinguisher is presented which uses roughly 2n chosen plaintexts or roughly 23n/2 known plaintexts.
L. Knudsen, H. Raddum
openaire   +1 more source

Switching Dynamics in Reaction Networks Induced by Molecular Discreteness [PDF]

, 2006
To study the fluctuations and dynamics in chemical reaction processes, stochastic differential equations based on the rate equation involving chemical concentrations are often adopted. When the number of molecules is very small, however, the discreteness
Gibson M A, Horsthemke W, Kunihiko Kaneko, Nicolis G, Olsson N, Thul R, van Kampen N G, Yuichi Togashi   +7 more
core   +2 more sources

Design of AL-13 Block Cipher Algorithm Based On Extended Feistel Network

Journal of Physics: Conference Series, 2019
In this paper, we design a new block cipher algorithm called AL-13. The structure of AL-13 is simple. We use Extended Feistel Network Type II with input-output 128 bits and key input 256 bits.
M. Sadikin, B. H. Susanti
semanticscholar   +1 more source

Equivalence of Generalised Feistel Networks

IACR Transactions on Symmetric Cryptology
This paper focuses on equivalences between Generalised Feistel Networks (GFN) of type-II. We introduce a new definition of equivalence which captures the concept that two GFNs are identical up to re-labelling of the inputs/outputs, and give a procedure to test this equivalence relation.
Derbez, Patrick, Euler, Marie
openaire   +4 more sources

Diffusion Analysis Of A Scalable Feistel Network

, 2007
A generalization of the concepts of Feistel Networks (FN), known as Extended Feistel Network (EFN) is examined. EFN splits the input blocks into n > 2 sub-blocks. Like conventional FN, EFN consists of a series of rounds whereby at least one sub-block is subjected to an F function.
Subariah Ibrahim, Mohd Aizaini Maarof
openaire   +1 more source

Improvement of the Minimal‐Guess‐Basis MILP Model and Its Application to ESF

IET Information Security, Volume 2026, Issue 1, 2026.
The guess‐and‐determine technique find wide applications in the recovery of unknown variables within given system of relations. The fundamental concept behind this technique involves guessing certain unknown variables and deducing the remaining ones based on the relational system.
Lingchen Li, Zhi Qiao, Yiming Dai, Yongzhuang Wei, Tao Ye, Bohui Wang   +5 more
wiley   +1 more source

Using Simon's Algorithm to Attack Symmetric-Key Cryptographic Primitives [PDF]

, 2017
We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon's algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives ...
Santoli, Thomas, Schaffner, Christian
core   +1 more source

The influence of hydrological seasonality and land use and cover on the relationship between dissolved organic carbon and carbon dioxide along a karst‐draining large tropical river

Limnology and Oceanography, Volume 70, Issue 10, Page 2858-2871, October 2025.
Abstract The partial pressure of carbon dioxide (pCO2) in rivers is influenced by carbonate weathering, soil CO2, photosynthesis, and the mineralization of dissolved organic carbon (DOC). In tropical regions, elevated temperatures intensify these processes. However, their seasonal dynamics remain poorly understood in large karst‐draining rivers.
Daniel Cuevas‐Lara, Javier Alcocer, Felipe García‐Oliva, Salvador Sánchez‐Carrillo, Ismael Soria‐Reinoso, Luis A. Oseguera   +5 more
wiley   +1 more source

New Algorithm for Exhausting Optimal Permutations for Generalized Feistel Networks

, 2022
The Feistel construction is one of the most studied ways of building block ciphers. Several generalizations were proposed in the literature, leading to the Generalized Feistel Network (GFN) construction, in which the round function operates on each pair of blocks in parallel until all branches are permuted.
Delaune, Stéphanie, Derbez, Patrick, Gontier, Arthur, Prud'Homme, Charles   +3 more
openaire   +2 more sources

Systematization of a 256-bit lightweight block cipher Marvin [PDF]

, 2018
In a world heavily loaded by information, there is a great need for keeping specific information secure from adversaries. The rapid growth in the research field of lightweight cryptography can be seen from the list of the number of lightweight stream as ...
Bhattacharya, Abhishek, Rarhi, Krishnendu, Saha, Sukanya   +2 more
core   +1 more source