Results 21 to 30 of about 10,154 (300)

Quantum computation of discrete logarithms in semigroups

open access: yesJournal 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

Asymmetric cipher protocol using conjugacy and discrete logarithm problem

open access: yesLietuvos Matematikos Rinkinys, 2009
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

Split logarithm problem and a candidate for a post-quantum signature scheme [PDF]

open access: yesComputer Science Journal of Moldova, 2022
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

Implications of the Arithmetic Ratio of Prime Numbers for RSA Security

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2023
The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm ...
Ivanov Andrey, Stoianov Nikolai
doaj   +1 more source

A new directed signature scheme on a general linear group over a group ring

open access: yesJournal of Innovative Applied Mathematics and Computational Sciences, 2023
 In this work, we propose a new directed digital signature scheme over a group ring whose security relies on the hardness of the discrete logarithm problem and the factorization search problem. This scheme is efficient as it requires very few operations
Sassia MAKHLOUF   +2 more
doaj   +1 more source

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

open access: yesCryptography, 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   +2 more
doaj   +1 more source

MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING

open access: yesBarekeng, 2022
El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was but later it was proven that using the
Sa'aadah Sajjana Carita, Herman Kabetta
doaj   +1 more source

On the Complexity of Hyperelliptic Discrete Logarithm Problem [PDF]

open access: yes, 1991
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

The discrete logarithm problem for exponents of bounded height [PDF]

open access: yesLMS Journal of Computation and Mathematics, 2014
AbstractLet$\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}G$be a cyclic group written multiplicatively (and represented in some concrete way).
Simon R. Blackburn, Sam Scott
openaire   +2 more sources

The formal solutions of Diophantine equation agy = bx + c

open access: yesHeliyon
We develop a novel method to completely solve the 3-term partial exponential Diophantine equation that represents a generalization of the standard discrete logarithm problem.
Xiazhou Yang
doaj   +1 more source

Home - About - Disclaimer - Privacy