Results 1 to 10 of about 6,764 (215)
ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS
Barekeng, 2023 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 +3 more sources
Comparison Between Algebraic Cryptanalysis on DES and NTRU
InPrime, 2023 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 +3 more sources
Algebraic Cryptanalysis with MRHS Equations
Cryptography, 2023 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
Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem [PDF]
, 2010 In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cryptography: the Section Finding Problem. Given an algebraic surface $X(x,y,t)\in\mathbb{F}_p[x,y,t]$ such that $\deg_{xy} X(x,y,t)= w$, the question is to find a pair of polynomials of ...
Jean‐Charles Faugère +1 more
+4 more sources
Algebraic Techniques in Linear Cryptanalysis [PDF]
Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012), 2012 Linear cryptanalysis is a statistical analysis method. Linear cryptanalysis constructs probabilistic patterns first and then distinguishes the cipher from a random permutation using lots of plaintext-ciphertext pairs. Linear cryptanalysis has a big data complexity. Algebraic attack attempts to exploit the algebraic structure of the cipher by expressing
Hongru Wei, Yafei Zheng
openalex +3 more sources
Integral Cryptanalysis Using Algebraic Transition Matrices
IACR Transactions on Symmetric Cryptology, 2023 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]
Sensors, 2022 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
Algebraic and Higher-Order Differential Cryptanalysis of Pyjamask-96
IACR Transactions on Symmetric Cryptology, 2020 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 +3 more sources
Algebraic Methods in Block Cipher Cryptanalysis [PDF]
, 2009 This thesis is a contribution to the field of algebraic cryptanalysis. Specifically the following topics have been studied: We construct and analyze Feistel and SLN ciphers that have a sound design strategy against linear and differential cryptanalysis. The encryption process for these cipher can be described by very simple polynomial equations.
Ralf-Philipp Weinmann
openalex +2 more sources
Algebraic Cryptanalysis of Deterministic Symmetric Encryption [PDF]
, 2015 Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and algebraic cryptanalysis.
Petr Sušil
openalex +3 more sources