Results 71 to 80 of about 169,709 (230)

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

Cryptanalysis of some protocols using matrices over group rings

, 2015
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring.
Eftekhari, Mohammad
core  

On the first fall degree of summation polynomials

Journal of Mathematical Cryptology, 2019
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.
Kousidis Stavros, Wiemers Andreas
doaj   +1 more source

Blind Proxy Re-Signature Scheme Based on Isomorphisms of Polynomials

IEEE Access, 2018
Most of the existing blind proxy re-signature schemes are designed based on the traditional public key cryptosystems, whose security relies on the hardness of big integer factoring, discrete logarithm, elliptic curve discrete logarithm, and so on ...
Li Huixian, Han Zhipeng, Wang Liqin, Pang Liaojun   +3 more
doaj   +1 more source

Computing Discrete Logarithms in Quadratic Orders [PDF]

Journal of Cryptology, 2000
Let \(\Delta \equiv 0,1 \pmod{4}\) be a nonsquare integer. The quadratic order of discriminant \(\Delta\) is defined as the \(\mathbb{Z}\)-module \[ \mathcal{O}_{\Delta} = \mathbb{Z} + {\Delta + \sqrt{\Delta} \over 2}{\mathbb{Z}} . \] The field of quotients is \(\mathbb{Q}({\sqrt{\Delta}})\).
openaire   +1 more source

Post-quantum signature algorithms based on the hidden discrete logarithm problem [PDF]

Computer Science Journal of Moldova, 2018
New options of the hidden discrete logarithm problem are proposed as cryptographic primitive of the post-quantum signature algorithms. Two signature schemes using computations in finite non-commutative algebras with associative multiplication operation
A.A. Moldovyan, N.A. Moldovyan
doaj  

Discrete Logarithms

In this paper we present two algorithms for computing discrete logarithms. We present some properties and show how we break the Diffie-Hellman protocol, which is considered to be very secure.
openaire   +1 more source

Fusion Discrete Logarithm Problems

, 2010
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of candidate algebraic structures which permit implementing the algorithms. In order to extend the applicability of discrete-
Schaffer, Martin, Rass, Stefan
openaire   +2 more sources

Revisiting Discrete Logarithm Reductions

IACR Communications in Cryptology
A reduction showing that the hardness of the discrete logarithm (DL) assumption implies the hardness of the computational Diffie-Hellman (CDH) assumption, given a suitable auxiliary input as advice, was first presented by den Boer [Crypto, 88]. We consider groups of prime order p, where p-1 is somewhat smooth (say, every prime q that divides p-1 ...
Maiara Bollauf, Roberto Parisella, Janno Siim   +2 more
openaire   +1 more source

A NEW PROPOSED METHOD FOR SOLVING AN ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM

Journal of Kufa for Mathematics and Computer, 2012
In this work, we present a new approach for solving Elliptic Curve Discrete Logarithm Problem. This method provides a new access to the field of attacking methods the Elliptic Curve Cryptosystems.
Ammar Ali Neamah
doaj   +1 more source