Results 1 to 10 of about 6,164,294 (286)

Discrete logarithm problem in matrix

Lietuvos Matematikos Rinkinys, 2023
In this paper the discrete logarithm problem in matrix in finite fields is formulated, possible ways of solution are given.
Povilas Tvarijonas, Gediminas Simonas Dosinas, Eligijus Sakalauskas   +2 more
doaj   +5 more sources

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

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   +5 more sources

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   +2 more sources

A new method for solving the elliptic curve discrete logarithm problem [PDF]

Groups, Complexity, Cryptology, 2021
The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem.
Ansari Abdullah, Ayan Mahalanobis, Vivek M. Mallick   +2 more
doaj   +1 more source

Index-calculus algorithm for calculating the discrete logarithms based on index tables

Trudy Odesskogo Politehničeskogo Universiteta, 2014
The complexity of the discrete logarithm problem is the basis of many asymmetric encryption algorithms cryptographic sta-bility, such as the widely used cryptographic algorithm RSA.
Артем Вікторович Соколов, В. Д. Буряк   +1 more
doaj   +5 more sources

The review on elliptic curves as cryptographic pairing groups [PDF]

Mathematics and Computational Sciences, 2021
Elliptic curve is a set of two variable points on polynomials of degree 3 over a field acted by an addition operation that forms a group structure. The motivation of this study is the mathematics behind that elliptic curve to the applicability within a ...
E Khamseh
doaj   +1 more source

DLP in semigroups: Algorithms and lower bounds

Journal of Mathematical Cryptology, 2022
The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups.
Han Jiao, Zhuang Jincheng
doaj   +1 more source

Variational Quantum Algorithm for Solving Discrete Logarithms [PDF]

Jisuanji kexue
The discrete logarithm problem is a significant challenge in number theory,and due to the difficulty of solving it,classical computers lack efficient algorithms for this task.As a result,the discrete logarithm problem is widely used in public key ...
ZHANG Xinglan, RONG Xiaojun
doaj   +1 more source

Computing discrete logarithm by interval-valued paradigm [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure.
Benedek Nagy, Sándor Vályi
doaj   +1 more source

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