Results 101 to 110 of about 6,764 (215)
Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser [PDF]
, 2016 The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless ...
Anshel, Iris +3 more
core +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
Morpheus: stream cipher for software & hardware applications [PDF]
, 2007 In a world where electronic devices with different characteristics are networked, privacy is an essential element for the communicating process. Privacy can be achieved by encryption algorithms with unique features based on the application that are ...
Komninos, N.
core
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
Dynamic MDS Matrices for Substantial Cryptographic Strength [PDF]
, 2011 Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers.
Malik, Muhammad Yasir, No, Jong-Seon
core +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