Results 81 to 90 of about 12,362 (163)
Discrete Logarithms on Elliptic Curves [PDF]
, 2017 Cryptographic protocols often make use of the inherent hardness of the classical discrete logarithm problem, which is to solve gx ≈ y ( mod p ) for x.
Blumenfeld, Aaron
core +1 more source
A Forward-Secure Digital Signature Based on Elliptic Curve
Dianxin kexue, 2015 The forward-secure digital signature is an important digital signature scheme.It requires that even if the attackers have already been given a signature key by invading a system in t time，it still can’t forge signatures before time t.In other words，the ...
Huiyan Chen +4 more
doaj +2 more sources
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem [PDF]
, 2017 Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multiplication.
Jetchev, Dimitar, Wesolowski, Benjamin
core +1 more source
Group structure of elliptic curves over ℤ/Nℤ
Journal of Mathematical CryptologyWe characterize the possible groups E(Z∕NZ)E\left({\mathbb{Z}}/N{\mathbb{Z}}) arising from elliptic curves over Z∕NZ{\mathbb{Z}}/N{\mathbb{Z}} in terms of the groups E(Fp)E\left({{\mathbb{F}}}_{p}), with pp varying among the prime divisors of NN.
Sala Massimiliano, Taufer Daniele
doaj +1 more source
Elliptic curves and their applications in cryptography [PDF]
The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file.Title from PDF of title page (University of Missouri--Columbia, viewed on ...
Pemberton, Michael Paul, 1983-
core
A Digital Signature Scheme for Long-Term Security [PDF]
, 2014 In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves.
Poulakis, Dimitrios, Rolland, Robert
core +1 more source
A Generic Approach to Searching for Jacobians
, 2007 We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing a large ...
Sutherland, Andrew V.
core +3 more sources
Group theory in cryptography [PDF]
, 2010 This paper is a guide for the pure mathematician who would like to know more about cryptography based on group theory. The paper gives a brief overview of the subject, and provides pointers to good textbooks, key research papers and recent survey papers ...
Blackburn, Simon R. +2 more
core
Comprehensive Efficient Implementations of ECC on C54xx Family of Low-cost Digital Signal Processors [PDF]
, 2015 Resource constraints in smart devices demand an efficient cryptosystem that allows for low power and memory consumption. This has led to popularity of comparatively efficient Elliptic curve cryptog-raphy (ECC).
Malik, Yasir
core +1 more source
Generating pairing-friendly elliptic curve parameters using sparse families
Journal of Mathematical Cryptology, 2018 The majority of methods for constructing pairing-friendly elliptic curves are based on representing the curve parameters as polynomial families. There are three such types, namely complete, complete with variable discriminant and sparse families. In this
Fotiadis Georgios, Konstantinou Elisavet
doaj +1 more source