Results 81 to 90 of about 235,655 (162)
Chosen-IV Algebraic Attack on Randomized Ciphers FASTA and HERA
Fully 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
A Cryptanalysis of the Original Domingo-Ferrer\u27s Algebraic Privacy Homomophism [PDF]
We propose a cryptanalysis of the original Domingo-Ferrer\u27s algebraic privacy homomorphism. We show that the scheme over $\Z_n$ can be broken by $d+1$ known plaintexts in $O(d^3\log^2 n)$ time when it has $d$ times expansion through the encryption ...
Jung Hee Cheon, Hyun Soo Nam
core +1 more source
Advanced Encryption Standard (AES) security relies on the Substitution box (S-Box), which provides nonlinearity and confusion. Because this algebraic form is fixed, the cipher can be attacked with algebraic and structural cryptanalysis.
Jassim Sameeh Abdulghafour +2 more
doaj +1 more source
Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Groebner bases
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we review and explain the existing algebraic cryptanalysis of multivariate cryptosystems from the hidden field equation (HFE) family.
Faugère, Jean-Charles, Joux, Antoine
core +2 more sources
D.STVL.7 - Algebraic cryptanalysis of symmetric primitives
The recent development of algebraic attacks can be considered an important breakthrough in the analysis of symmetric primitives; these are powerful techniques that apply to both block and stream ciphers (and potentially hash functions).
Albrecht, Martin +4 more
core
Algebraic Cryptanalysis of the Data Encryption Standard [PDF]
In spite of growing importance of AES, the Data Encryption Standard is by no means obsolete. DES has never been broken from the practical point of view.
Nicolas T. Courtois, Gregory V. Bard
core
Preprocessing Techniques in Algebraic Cryptanalysis
Algebraic cryptanalysis is a standard set of techniques for analyzing and attacking practical symmetric cryptographic primitives. It involves representing the relationship between a pair of plaintext, ciphertext and the key as a system of polynomial ...
Mašková, Kristýna
core
Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
In this paper we demonstrate how to use Mixed Integer Linear Programming to optimize guessing strategies for algebraic cryptanalysis with applications to the block cipher EPCBC.
Bulygin, Stanislav +2 more
core
Cryptanalysis of plwe based on zero-trace quadratic roots
We extend two of the attacks on the PLWE problem presented by Elias, Lauter et al. to a ring Rq=Fq[x]/(f(x)) ${R}_{q}={\mathbb{F}}_{q}\left[x\right]/\left(f\left(x\right)\right)$ where the irreducible monic polynomial f(x)∈Z[x] $f\left(x\right)\in ...
Barbero-Lucas Beatriz +4 more
doaj +1 more source
Ultrametric integral cryptanalysis [PDF]
A systematic method to analyze divisibility properties is proposed. In integral cryptanalysis, divisibility properties interpolate between bits that sum to zero (divisibility by two) and saturated bits (divisibility by $2^{n - 1}$ for $2^n$ inputs ...
Tim Beyne, Michiel Verbauwhede
core

