Results 11 to 20 of about 242 (42)
Toric surface codes and Minkowski sums [PDF]
, 2006 Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner. In this paper,
Little, John, Schenck, Hal
core +4 more sources
Protecting ECC Against Fault Attacks: The Ring Extension Method Revisited
Journal of Mathematical Cryptology, 2020 Due to its shorter key size, elliptic curve cryptography (ECC) is gaining more and more popularity. However, if not properly implemented, the resulting cryptosystems may be susceptible to fault attacks.
Joye Marc
doaj +1 more source
New Techniques for SIDH-based NIKE
Journal of Mathematical Cryptology, 2020 We consider the problem of producing an efficient, practical, quantum-resistant non-interactive key exchange (NIKE) protocol based on Supersingular Isogeny Diffie-Hellman (SIDH).
Urbanik David, Jao David
doaj +1 more source
Classes of weak Dembowski–Ostrom polynomials for multivariate quadratic cryptosystems
Journal of Mathematical Cryptology, 2015 T. Harayama and D. K. Friesen [J. Math. Cryptol. 1 (2007), 79–104] proposed the linearized binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski–Ostrom (DO) polynomials in this framework over the finite field 𝔽2.
Alam Bilal, Özbudak Ferruh, Yayla Oğuz
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
Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes [PDF]
, 2012 We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander.
Adams +23 more
core +5 more sources
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
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
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