Results 31 to 40 of about 6,764 (215)
Algebraic Side Channel Attack on Trivium and Grain Ciphers
IEEE Access, 2017 Solving a system of multivariate quadratic equations obtained through algebraic cryptanalysis is a nondeterministic polynomial time-complete problem. Owing to the trend of stream ciphers based on nonlinear update, the success of algebraic attacks has ...
Asif Raza Kazmi +4 more
doaj +1 more source
An algorithm for constructing S-boxes for block symmetric encryption
Universal Journal of Mathematics and Applications, 2018 This article presents an algorithm for the generation of S-boxes with the maximum algebraic immunity and high nonlinearity. The algorithm is founded method of the permutation of output element of S-box. On basis of the proposed method, $S(8\times 8)$-box
Alijon Bozorbayevicha Sattarov +1 more
doaj +1 more source
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks
Transactions on Cryptographic Hardware and Embedded Systems, 2021 White-box cryptography attempts to protect cryptographic secrets in pure software implementations. Due to their high utility, white-box cryptosystems (WBC) are deployed by the industry even though the security of these constructions is not well defined ...
Okan Seker +2 more
doaj +1 more source
KLEIN: A New Family of Lightweight Block Ciphers [PDF]
, 2010 Resource-efficient cryptographic primitives become fundamental for realizing both security and efficiency in embedded systems like RFID tags and sensor nodes.
A. Bogdanov +39 more
core +6 more sources
The complexity of MinRank [PDF]
, 2019 In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case.
Caminata, Alessio, Gorla, Elisa
core +2 more sources
Algebraic Collision Attacks on Keccak
IACR Transactions on Symmetric Cryptology, 2021 In this paper, we analyze the collision resistance of the two smallest versions of Keccak which have a width of 200 and 400 bits respectively. We show that algebraic and linearization techniques can serve collision cryptanalysis by using some interesting
Rachelle Heim Boissier +2 more
doaj +1 more source
Security analysis of an encryption scheme based on nonpositional polynomial notations
Open Engineering, 2016 The aim of the research was to conduct a cryptographic analysis of an encryption scheme developed on the basis of nonpositional polynomial notations to estimate the algorithm strength. Nonpositional polynomial notations (NPNs) are residue number systems (
Kapalova Nursulu +1 more
doaj +1 more source
A Combinatorial Problem Related to Sparse Systems of Equations [PDF]
, 2015 Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis.
Horak, Peter, Semaev, Igor, Tuza, Zsolt
core +2 more sources
Generation of Nonlinear Substitutions by Simulated Annealing Algorithm
Information, 2023 The problem of nonlinear substitution generation (S-boxes) is investigated in many related works in symmetric key cryptography. In particular, the strength of symmetric ciphers to linear cryptanalysis is directly related to the nonlinearity of ...
Alexandr Kuznetsov +7 more
doaj +1 more source
Cryptanalysis of an Algebraic Privacy Homomorphism [PDF]
, 2003 We use linear algebra to show that an algebraic privacy homomorphism proposed by Domingo-Ferrer is insecure for some parameter settings.
openaire +2 more sources