Results 81 to 90 of about 950 (154)

Cryptanalysis of plwe based on zero-trace quadratic roots

open access: yesJournal of Mathematical Cryptology
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

A Cryptanalysis of the Original Domingo-Ferrer\u27s Algebraic Privacy Homomophism [PDF]

open access: yes, 2003
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  

Algebraic attacks for the rank decoding problem [PDF]

open access: yes
École thématiqueAlgebraic cryptanalysis has become unavoidable in the cryptanalysis and design of schemes in cryptography. In the first part, I explain what is a good algebraic modeling, and how we can estimate the complexity of solving a polynomial ...
Bardet, Magali
core   +1 more source

A Cryptanalysis of the Original Domingo-Ferrer’s Algebraic Privacy Homomophism, Cryptology ePrint Archive, Report 2003/221 [PDF]

open access: yes, 2003
. We propose a cryptanalysis of the original Domingo-Ferrer’s algebraic privacy homomorphism. We show that the scheme over Zn 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. Furthermore
Jung Hee Cheon, Hyun Soo Nam
core  

Algebraic Methods in Block Cipher Cryptanalysis [PDF]

open access: yes, 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 ...
Weinmann, Ralf-Philipp
core  

Ultrametric integral cryptanalysis [PDF]

open access: yes
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  

Home - About - Disclaimer - Privacy