Results 31 to 40 of about 6,665 (199)
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
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
Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis
IEEE Access, 2023 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 +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
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 Techniques in Linear Cryptanalysis
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
Hong Ru Wei, Ya Fei Zheng
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 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
openaire +2 more sources
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
New cryptanalysis of LowMC with algebraic techniques
Designs, Codes and Cryptography, 2023 AbstractLowMC is a family of block ciphers proposed by Albrecht et al. at EUROCRYPT 2015, which is tailored specifically for FHE and MPC applications. At ToSC 2018, a difference enumeration attack was given for the cryptanalysis of low-data instances of full LowMCv2 with few applied S-boxes per round.
Wenxiao Qiao +4 more
openaire +1 more source