Results 11 to 20 of about 8,170 (257)
On the Complexity of Generalized Discrete Logarithm Problem
Generalized Discrete Logarithm Problem (GDLP) is an extension of the Discrete Logarithm Problem where the goal is to find $x\in\mathbb{Z}_s$ such $g^x\mod s=y$ for a given $g,y\in\mathbb{Z}_s$. Generalized discrete logarithm is similar but instead of a single base element, uses a number of base elements which does not necessarily commute with each ...
Cem M. Unsal, Rasit Onur Topaloglu
openaire +2 more sources
DLP in semigroups: Algorithms and lower bounds
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]
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]
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
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
Privacy-Preserved Image Protection Supporting Different Access Rights
The boom in cloud computing and social networking has led to a large number of online users in the networks. It is necessary to use appropriate privacy protection mechanisms to prevent personal privacy leakage.
Ya-Fen Chang +2 more
doaj +1 more source
The Discrete Logarithm Problem [PDF]
For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z∕pZ)∗ is at present a very difficult problem. The security of certain cryptosystems is based on the difficulty of this computation. In this expository paper we discuss several generalizations of the discrete logarithm problem and we describe various ...
openaire +2 more sources
Split logarithm problem and a candidate for a post-quantum signature scheme [PDF]
A new form of the hidden discrete logarithm problem, called split logarithm problem, is introduced as primitive of practical post-quantum digital signature schemes, which is characterized in using two non-permutable elements $A$ and $B$ of a finite non-
A.A. Moldovyan, N.A. Moldovyan
doaj +1 more source
Asymmetric cipher protocol using conjugacy and discrete logarithm problem
The paper proposes asymmetric cipher protocol based on matrix field over some field F. The asymmetric cipher is based on two simultaneous problems: matrix conjugator search problem (MCSP) and matrix discrete logarithm problem (MDLP).
Andrius Raulynaitis +1 more
doaj +1 more source
On the Complexity of Hyperelliptic Discrete Logarithm Problem [PDF]
We give a characterization for the intractability of hyperelliptic discrete logarithm problem from a viewpoint of computational complexity theory. It is shown that the language of which complexity is equivalent to that of the hyperelliptic discrete logarithm problem is in NP ∩ co-AM, and that especially for elliptic curves, the corresponding language ...
Hiroki Shizuya +2 more
openaire +1 more source

