Results 21 to 30 of about 269 (65)

Complexity bounds on Semaev’s naive index calculus method for ECDLP

Journal of Mathematical Cryptology, 2020
Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as ...
Yokoyama Kazuhiro, Yasuda Masaya, Takahashi Yasushi, Kogure Jun   +3 more
doaj   +1 more source

On the leakage-resilient key exchange

Journal of Mathematical Cryptology, 2017
Typically, secure channels are constructed from an authenticated key exchange (AKE) protocol, which authenticates the communicating parties based on long-term public keys and establishes secret session keys.
Alawatugoda Janaka
doaj   +1 more source

Every Binary Self-Dual Code Arises From Hilbert Symbols

, 2012
In this paper we construct binary self-dual codes using the \'etale cohomology of $\mathbb{Z}/2$ on the spectra of rings of $S$-integers of global fields.
Chinburg, Ted, Zhang, Ying
core   +1 more source

One- and Two-Point Codes over Kummer Extensions

, 2016
We compute the Weierstrass semigroup at one totally ramified place for Kummer extensions defined by $y^m=f(x)^{\lambda}$ where $f(x)$ is a separable polynomial over $\mathbb{F}_q$.
Masuda, Ariane M., Quoos, Luciane, Sepúlveda, Alonso   +2 more
core   +1 more source

Application of Mordell–Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves

Journal of Mathematical Cryptology
This article aims to speed up (the precomputation stage of) multiscalar multiplication (MSM) on ordinary elliptic curves of j-invariant 0 with respect to specific “independent” (also known as “basis”) points.
Koshelev Dmitrii
doaj   +1 more source

DAGS: Key encapsulation using dyadic GS codes

Journal of Mathematical Cryptology, 2018
Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo, Barreto Paulo S. L. M., Boidje Brice Odilon, Cayrel Pierre-Louis, Dione Gilbert Ndollane, Gaj Kris, Gueye Cheikh Thiécoumba, Haeussler Richard, Klamti Jean Belo, N’diaye Ousmane, Nguyen Duc Tri, Persichetti Edoardo, Ricardini Jefferson E.   +12 more
doaj   +1 more source

Pl\"ucker Embedding of Cyclic Orbit Codes [PDF]

, 2012
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.Comment: to appear in ...
Trautmann, Anna-Lena
core  

On linear codes with random multiplier vectors and the maximum trace dimension property

Journal of Mathematical Cryptology
Let CC be a linear code of length nn and dimension kk over the finite field Fqm{{\mathbb{F}}}_{{q}^{m}}. The trace code Tr(C){\rm{Tr}}\left(C) is a linear code of the same length nn over the subfield Fq{{\mathbb{F}}}_{q}.
Erdélyi Márton, Hegedüs Pál, Kiss Sándor Z., Nagy Gábor P.   +3 more
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

A note on cohomology and algebraic geometric codes on the curves over rings

Annals of the West University of Timisoara: Mathematics and Computer Science
Let A be a local Artinian ring with residue field k(A). Let X be a curve over A and let be X′ = X ×spec A spec k(A) the fiber of X over k(A). Consider ℒ an invertible sheaf on X and ℒ ′ = ϕ*ℒ ∈ Pic(X′), where ϕ : X′ → X is the natural map.
Nyamda Francis, Mouaha Christophe
doaj   +1 more source