Results 11 to 20 of about 54 (53)
Codes parameterized by the edges of a bipartite graph with a perfect matching
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
Sarabia Manuel González +1 more
doaj +1 more source
Nonlinearities on particular elliptic curves subspaces and applications
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 Researching on mathematical models for cryptography means to, primary, define the optimal spaces and rules for which we can archive the maximum time to find the involved parameters of the keys and, in the same time, to optimise the time for key ...
Alsaedi Ramzi +2 more
doaj +1 more source
On a relation between GAG codes and AG codes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 In this paper, we first give a relationship between generalized algebraic geometry codes (GAG codes) and algebraic geometry codes (AG codes). More precisely, we show that a GAG code is contained (up to isomorphism) in a suitable AG code.
Şenel Engin, Öke Figen
doaj +1 more source
Algebraic approaches for solving isogeny problems of prime power degrees
Journal of Mathematical Cryptology, 2020 Recently, supersingular isogeny cryptosystems have received attention as a candidate of post-quantum cryptography (PQC). Their security relies on the hardness of solving isogeny problems over supersingular elliptic curves. The meet-in-the-middle approach
Takahashi Yasushi +5 more
doaj +1 more source
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Journal of Mathematical Cryptology, 2014 We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main technical idea in our scheme is that we transmit the images of torsion bases
De Feo Luca, Jao David, Plût Jérôme
doaj +1 more source
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 +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
Journal of Mathematical CryptologyThis 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
On linear codes with random multiplier vectors and the maximum trace dimension property
Journal of Mathematical CryptologyLet 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 +3 more
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 +12 more
doaj +1 more source