Results 11 to 20 of about 7,844 (165)
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
A deterministic algorithm for the discrete logarithm problem in a semigroup
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left ...
Tinani Simran, Rosenthal Joachim
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
Split logarithm problem and a candidate for a post-quantum signature scheme [PDF]
Computer 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
Asymmetric cipher protocol using conjugacy and discrete logarithm problem
Lietuvos 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
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
Journal of Mathematical Cryptology, 2010 The paper provides a cryptanalysis of the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group ℝ/ℤ (the reals ...
Blackburn Simon R.
doaj +1 more source
Implications of the Arithmetic Ratio of Prime Numbers for RSA Security
International 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
Journal 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
The Discrete Logarithm Problem [PDF]
, 2016 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
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 +2 more
doaj +1 more source