Results 31 to 40 of about 105 (87)

On algebraic geometric codes and some related codes [PDF]

open access: yes, 2006
Thesis (MSc (Mathematics))--University of Stellenbosch, 2006.The main topic of this thesis is the construction of the algebraic geometric codes (Goppa codes), and their decoding by the list-decoding, which allows one to correct beyond half of the ...
Guenda, Kenza
core  

On the supersingular GPST attack

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

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

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

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

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

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

Elliptic curve and k-Fibonacci-like sequence

open access: yesScientific 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   +2 more
doaj   +1 more source

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

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

Генератор ПСЧ на норменой группе

open access: yes, 2020
Let be a prime number, ∈ N, (︁ − )︁ = −1, > 2, and let denotes the set of of residue classes modulo over the ring of Gaussian integers in imaginary quadratic field Q( √ −) with norms which are congruented with 1 modulo .
Варбанець, Сергій Павлович   +4 more
core  

Predicate signatures from pair encodings via dual system proof technique

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

The Eleventh Power Residue Symbol

open access: yesJournal of Mathematical Cryptology, 2020
This paper presents an efficient algorithm for computing 11th-power residue symbols in the cyclo-tomic field ℚ(ζ11),$ \mathbb{Q}\left( {{\zeta }_{11}} \right), $where 11 is a primitive 11th root of unity.
Joye Marc   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy