Results 71 to 80 of about 284 (159)
MRHS solver based on linear algebra and exhaustive search
Journal of Mathematical Cryptology, 2018 We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj +1 more source
Key-Recovery Attacks on Full Kravatte
IACR Transactions on Symmetric Cryptology, 2018 This paper presents a cryptanalysis of full Kravatte, an instantiation of the Farfalle construction of a pseudorandom function (PRF) with variable input and output length.
Colin Chaigneau +6 more
doaj +1 more source
Cryptanalysis by Algebraic Relations
Algebraic relations are a high-degree generalization of linear relationships. Given an algebraic relation it is possible to predict the outcome of single components of a polynomial equation system or refute points that do not lie in the image of a polynomial map. This work investigates the application of algebraic relations to cryptanalysis, presenting
openaire +3 more sources
HHL Algorithm for Tensor-Decomposable Matrices
Quantum ReportsWe use the HHL algorithm to retrieve a quantum state holding the algebraic normal form (ANF) of a Boolean function. Unlike the standard HHL applications, we do not describe the cipher as an exponentially big system of equations.
Cezary Pilaszewicz, Marian Margraf
doaj +1 more source
Minimal basis of the syzygies module of leading terms
Труды Института системного программирования РАН, 2019 Systems of polynomial equations are one of the most universal mathematical objects. Almost all the problems of cryptographic analysis can be reduced to finding solutions to systems of polynomial equations.
A. V. Sokurov
doaj +1 more source
GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS
Prikladnaya diskretnaya matematika, 2017 Summary: We show that many known schemes of the cryptographic key public exchange protocols in algebraic cryptography using two-sided multiplications are the special cases of a general scheme of this type. In most cases, such schemes are built on the platforms that are subsets of some linear spaces.
Roman'kov, V. A., Obzor, A. A.
openaire +1 more source
Random subgroups and analysis of the length-based and quotient attacks
Journal of Mathematical Cryptology, 2008 In this paper we discuss generic properties of “random subgroups” of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they “sit” inside G in a very particular way.
Myasnikov Alexei G., Ushakov Alexander
doaj +1 more source
Algebraic Cryptanalysis of Deterministic Symmetric Encryption
, 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.
openaire +2 more sources
Formal Power Series on Algebraic Cryptanalysis
, 2020 In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of regularity can be easily computed using a univariate formal power series under the semi-regularity assumption ...
openaire +2 more sources
Chosen-IV Algebraic Attack on Randomized Ciphers FASTA and HERA
IACR Transactions on Symmetric CryptologyFully homomorphic encryption (FHE) enables computation on encrypted data without decryption, providing strong guarantees for privacy-preserving applications.
Fukang Liu +6 more
doaj +1 more source