Results 31 to 40 of about 108 (89)

Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation?

Journal of Mathematical Cryptology, 2020
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field 𝔽p2. Using the representation technique, we reduce ECDLP to a multivariate polynomial zero testing problem.
Delaplace Claire, May Alexander
doaj   +1 more source

Cryptanalysis of “MAKE”

Journal of Mathematical Cryptology, 2022
Rahman and Shpilrain proposed a Diffie–Hellman style key exchange based on a semidirect product of n×nn\times n-matrices over a finite field. We show that, using public information, an adversary can recover the agreed upon secret key by solving a system ...
Brown Daniel R. L., Koblitz Neal, LeGrow Jason T.   +2 more
doaj   +1 more source

Bounds on the list-decoding radius of reed-solomon codes

, 2003
Techniques are presented for computing upper and lower bounds on the number of errors that can be corrected by list decoders for general block codes and, speci cally, for Reed-Solomon (RS) codes.
Gitit Ruckenstein, Ron M. Roth
core   +1 more source

On the supersingular GPST attack

Journal of Mathematical Cryptology, 2021
The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange.
Basso Andrea, Pazuki Fabien
doaj   +1 more source

Cryptanalysis of plwe based on zero-trace quadratic roots

Journal 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, Blanco-Chacón Iván, Durán-Díaz Raúl, Martín Sánchez-Ledesma Rodrigo, Njah Nchiwo Rahinatou Yuh   +4 more
doaj   +1 more source

Time-memory trade-offs for index calculus in genus 3

Journal of Mathematical Cryptology, 2015
In this paper, we present a variant of Diem's O˜(q)${\widetilde{O}(q)}$ index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field 𝔽q.
Laine Kim, Lauter Kristin
doaj   +1 more source

Elliptic curve and k-Fibonacci-like sequence

Scientific African, 2023
In this paper, we will introduce a modified k-Fibonacci-like sequence defined on an elliptic curve and prove Binet’s formula for this sequence. Moreover, we give a new encryption scheme using this sequence.
Zakariae Cheddour, Abdelhakim Chillali, Ali Mouhib   +2 more
doaj   +1 more source

Random Linear Code Based Public Key Encryption Scheme RLCE [PDF]

, 2015
Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes.
Yongge Wang
core  

On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in ℚ(𝜁2𝑠)

Journal of Mathematical Cryptology, 2019
A family of ring-based cryptosystems, including the multilinear maps of Garg, Gentry and Halevi [Candidate multilinear maps from ideal lattices, Advances in Cryptology—EUROCRYPT 2013, Lecture Notes in Comput. Sci.
Biasse Jean-François, Song Fang
doaj   +1 more source

Predicate signatures from pair encodings via dual system proof technique

Journal of Mathematical Cryptology, 2019
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.
Nandi Mridul, Pandit Tapas
doaj   +1 more source