Results 81 to 90 of about 6,665 (199)
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 +3 more
core +1 more source
Complexity Engineering: How Subjective Issues Become Objective
Complexity, Volume 2025, Issue 1, 2025.This study details the substantial technological progress experienced in the last few decades, its impact on engineering, and how machine learning along with data science can contribute to solving human problems. The objective here is to establish the principles of “complexity engineering,” based on the works of Edgar Morin, and to demonstrate how ...
José Roberto C. Piqueira +3 more
wiley +1 more source
A new S-box pattern generation based on chaotic enhanced logistic map: case of 5-bit S-box
CybersecurityCryptography 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 +3 more
doaj +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 +2 more
openaire +2 more sources
International Journal of Distributed Sensor Networks, Volume 2025, Issue 1, 2025.The growth of billions of devices functioning in resource‐constrained situations in the Internet of Things (IoT) era poses serious security issues. As a result of their limited processing power efficiency, memory, and battery life, traditional cryptographic algorithms like elliptic curve cryptography (ECC), Rivest–Shamir–Adleman (RSA), and Advanced ...
Nahom Gebeyehu Zinabu +4 more
wiley +1 more source
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 +5 more
core
Journal of Function Spaces, Volume 2025, Issue 1, 2025.Nonassociative algebra presents multiple options for comprehending and dealing with difficulties in graph theory, artificial intelligence, and cryptography. Its distinctive traits introduce genuine concepts and procedures not found in conventional associative algebra, yielding to new results from studies and breakthroughs in multiple disciplines ...
Mohammad Mazyad Hazzazi +5 more
wiley +1 more source
A note on some algebraic trapdoors for block ciphers
, 2018 We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al.
Calderini, Marco
core
Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser [PDF]
, 2016 The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless ...
Anshel, Iris +3 more
core +1 more source
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