Results 11 to 20 of about 559 (211)
SIDH Hybrid Schemes with Classical Component Based on the Discrete Logarithm Problem over Finite Field Extension [PDF]
The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid
Michał Wroński +2 more
doaj +1 more source
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
On the Discrete Logarithmic Minkowski Problem [PDF]
If \(K\subset{\mathbb R}^n\) is a convex body (compact and convex set with non-empty interior) containing the origin as an interior point, the cone-volume measure of \(K\) is the Borel measure on the unit sphere \(S^{n-1}\) defined by \[ V_K(\omega)=\frac{1}{n}\int_{x\in\nu_K^{-1}(\omega)}x\cdot\nu_K(x)d\mathcal{H}^{n-1}(x), \quad \text{for each Borel }
Böröczky, Károly (Ifj.) +2 more
openaire +2 more sources
On Search Complexity of Discrete Logarithm
In this work, we study the discrete logarithm problem in the context of TFNP - the complexity class of search problems with a syntactically guaranteed existence of a solution for all instances. Our main results establish that suitable variants of the discrete logarithm problem are complete for the complexity class PPP, respectively PWPP, i.e., the ...
Pavel Hubácek, Jan Václavek
openaire +4 more sources
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
Logarithm of multivector in real 3D Clifford algebras
Closed form expressions for a logarithm of general multivector (MV) in basis-free form in real geometric algebras (GAs) Clp,q are presented for all n = p + q = 3.
Artūras Acus, Adolfas Dargys
doaj +1 more source
Finding discrete logarithm in $F_p^* $
Additional python code file in pdf ...
openaire +2 more sources
The discrete logarithm problem in Bergman's non-representable ring
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
Cryptanalysis of the cryptosystems based on the generalized hidden discrete logarithm problem [PDF]
In this paper, we will solve an important form of hidden discrete logarithm problem (HDLP) and a generalized form of HDLP (GHDLP) over non-commutative associative algebras (FNAAs). We will reduce them to discrete logarithm problem (DLP) in a finite field
Yanlong Ma
doaj +1 more source
Individual discrete logarithm with sublattice reduction
Designs, Codes and Cryptography ...
Al Aswad, Haetham, Pierrot, Cécile
openaire +5 more sources

