Results 31 to 40 of about 458 (184)
Algebraic cryptanalysis and new security enhancements [PDF]
Moscow Journal of Combinatorics and Number Theory, 2020 We briefly discuss linear decomposition and nonlinear decomposition attacks using polynomial-time deterministic algorithms that recover the secret shared keys from public data in many schemes of algebraic cryptography. We show that in this case, contrary to common opinion, typical computational security assumptions are not very relevant to the security
openaire +2 more sources
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
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
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
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
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
Algebraic Techniques in Differential Cryptanalysis Revisited [PDF]
, 2011 At FSE 2009, Albrecht et al. proposed a new cryptanalytic method that combines algebraic and differential cryptanalysis. They introduced three new attacks, namely Attack A, Attack B and Attack C. For Attack A, they explain that the time complexity is difficult to determine.
Wang, Meiqin +3 more
openaire +3 more sources
Algebraic Analysis of a Simplified Encryption Algorithm GOST R 34.12-2015
Computation, 2020 In January 2016, a new standard for symmetric block encryption was established in the Russian Federation. The standard contains two encryption algorithms: Magma and Kuznyechik.
Evgenia Ishchukova +2 more
doaj +1 more source
Cogent Engineering, 2022 This paper considers a new method for obtaining an S-box, which is one of the nonlinear transformations used in modern block-symmetric cipher systems.
Ardabek Khompysh +4 more
doaj +1 more source