Results 1 to 10 of about 284 (159)
Algebraic Cryptanalysis with MRHS Equations
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 +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
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
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 +1 more source
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 +1 more source
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
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems [PDF]
In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic cryptanalysis. We describe how cryptanalysis problems are reduced to SAT in
Alexander Semenov +4 more
doaj +1 more source
A Substitution Box for Lightweight Ciphers to Secure Internet of Things
The Internet of Things is a resource-constrained device that demands lightweight cryptographic solutions to achieve high performance and optimal security.
V. Panchami, Mahima Mary Mathews
doaj +1 more source
Algebraic and quantum attacks on two digital signature schemes
In this article, we analyze two digital signature schemes, proposed in Moldovyan et al., that use finite noncommutative associative algebras as underlying platforms.
Roman’kov Vitaly +2 more
doaj +1 more source
Algebraic and Higher-Order Differential Cryptanalysis of Pyjamask-96
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 +1 more source

