Results 21 to 30 of about 762,592 (290)

Quantum computation of discrete logarithms in semigroups

Journal of Mathematical Cryptology, 2014
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines.
Childs Andrew M., Ivanyos Gábor
doaj   +1 more source

The discrete logarithm problem in Bergman's non-representable ring

Journal of Mathematical Cryptology, 2012
Bergman's ring , parameterized by a prime number p, is a ring with p5 elements that cannot be embedded in a ring of matrices over any commutative ring. This ring was discovered in 1974.
Banin Matan, Tsaban Boaz
doaj   +1 more source

Individual discrete logarithm with sublattice reduction

Designs, Codes and Cryptography, 2023
Designs, Codes and Cryptography ...
Al Aswad, Haetham, Pierrot, Cécile
openaire   +6 more sources

Logarithm of multivector in real 3D Clifford algebras

Nonlinear Analysis, 2023
Closed form expressions for a logarithm of general multivector (MV) in basis-free form in real geometric algebras (GAs) Clp,q are presented for all n = p + q = 3.
Artūras Acus, Adolfas Dargys
doaj   +1 more source

Finding discrete logarithm in $F_p^* $

CoRR, 2021
Additional python code file in pdf ...
openaire   +2 more sources

Cryptanalysis of the cryptosystems based on the generalized hidden discrete logarithm problem [PDF]

Computer Science Journal of Moldova
In this paper, we will solve an important form of hidden discrete logarithm problem (HDLP) and a generalized form of HDLP (GHDLP) over non-commutative associative algebras (FNAAs). We will reduce them to discrete logarithm problem (DLP) in a finite field
Yanlong Ma
doaj   +1 more source

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem

Journal of Mathematical Cryptology, 2020
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh, Kosters Michiel, Petit Christophe, Yeo Sze Ling, Yun Yang   +4 more
doaj   +1 more source

Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]

Jisuanji gongcheng, 2016
As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj   +1 more source

Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn

Cryptography, 2018
In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al.
María Isabel González Vasco, Angela Robinson, Rainer Steinwandt   +2 more
doaj   +1 more source

Discrete Logarithm Factory

IACR Communications in Cryptology
The Number Field Sieve and its variants are the best algorithms to solve the discrete logarithm problem in finite fields (except for the weak small characteristic case). The Factory variant accelerates the computation when several prime fields are targeted.
Haetham Al Aswad, Emmanuel Thomé, Cécile Pierrot   +2 more
openaire   +4 more sources