Results 1 to 10 of about 458 (184)
Algebraic Cryptanalysis with MRHS Equations [PDF]
In this work, we survey the existing research in the area of algebraic cryptanalysis based on Multiple Right-Hand Sides (MRHS) equations (MRHS cryptanalysis).
Pavol Zajac
doaj +3 more sources
Algebraic and Higher-Order Differential Cryptanalysis of Pyjamask-96 [PDF]
Cryptographic competitions, like the ongoing NIST call for lightweight cryptography, always provide a thriving research environment, where new interesting ideas are proposed and new cryptographic insights are made. One proposal for this NIST call that is
Christoph Dobraunig +2 more
doaj +9 more sources
Comparison Between Algebraic Cryptanalysis on DES and NTRU
Algebraic cryptanalysis is a cryptanalysis method that aims to exploit the algebraic structure of an encryption algorithm to obtain the secret key. Algebraic cryptanalysis becomes interesting because it uses a small amount of known plaintext, which in ...
Fadila Paradise, Kiki Ariyanti Sugeng
doaj +4 more sources
ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS
NTRU is a lattice-based public-key cryptosystem designed by Hoffstein, Pipher, and Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Fadila Paradise, Kiki Ariyanti Sugeng
doaj +4 more sources
Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis [PDF]
In this paper we describe a class of cryptographic guess-and-determine attacks which is based on the notion of a linearizing set. A linearizing set-based attack is applied to a system of Multivariate Quadratic equations (MQ) over $GF(2)$ field, which ...
Alexander Semenov +3 more
doaj +2 more sources
Optimization of a Simulated Annealing Algorithm for S-Boxes Generating [PDF]
Cryptographic algorithms are used to ensure confidentiality, integrity and authenticity of data in information systems. One of the important areas of modern cryptography is that of symmetric key ciphers.
Alexandr Kuznetsov +5 more
doaj +2 more sources
Integral Cryptanalysis Using Algebraic Transition Matrices
In this work we introduce algebraic transition matrices as the basis for a new approach to integral cryptanalysis that unifies monomial trails (Hu et al., Asiacrypt 2020) and parity sets (Boura and Canteaut, Crypto 2016).
Tim Beyne, Michiel Verbauwhede
doaj +3 more sources
Algebraic Cryptanalysis Scheme of AES-256 Using Gröbner Basis [PDF]
The zero-dimensional Gröbner basis construction is a crucial step in Gröbner basis cryptanalysis on AES-256. In this paper, after performing an in-depth study on the linear transformation and the system of multivariate polynomial equations of AES-256 ...
Kaixin Zhao, Jie Cui, Zhiqiang Xie
doaj +2 more sources
Multiset-Algebraic Cryptanalysis of Reduced Kuznyechik, Khazad, and secret SPNs
We devise the first closed formula for the number of rounds of a blockcipher with secret components so that these components can be revealed using multiset, algebraic-degree, or division-integral properties, which in this case are equivalent.
Alex Biryukov +2 more
doaj +3 more sources
RAFA: Redundancies-assisted Algebraic Fault Analysis and its implementation on SPN block ciphers
Algebraic Fault Analysis (AFA) is a cryptanalysis for block ciphers proposed by Courtois et al., which incorporates algebraic cryptanalysis to overcome the complexity of manual analysis within the context of Differential Fault Analysis (DFA).
Zehong (Zephyr) Qiu, Fan Zhang
doaj +1 more source

