Results 21 to 30 of about 6,164,294 (286)
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 +2 more sources
Implications of the Arithmetic Ratio of Prime Numbers for RSA Security
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
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
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
A new directed signature scheme on a general linear group over a group ring
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
FHPKE based on multivariate discrete logarithm problem [PDF]
Previously I proposed fully homomorphic public-key encryption (FHPKE) based on discrete logarithm problem which is vulnerable to quantum computer attacks. In this paper I propose FHPKE based on multivariate discrete logarithm assumption.
Masahiro Yagisawa
core +1 more source
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
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 discrete logarithm problem for plane curves [PDF]
In this article the discrete logarithm problem in degree 0 class groups of curves over finite fields given by plane models is studied. It is proven that the discrete logarithm problem for non-hyperelliptic curves of genus 3 (given by plane models of degree 4) can be solved in an expected time of
openaire +2 more sources
The discrete logarithm problem for exponents of bounded height [PDF]
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 +3 more sources
Discrete logarithm problem in cryptography
V tem diplomskem delu obravnavamo problem diskretnega logaritma in napade na ta problem. Na začetku razložimo matematično ozadje, ki je potrebno za delovanje algoritmov.
Cajnkar, Nino
core

