Results 11 to 20 of about 15,305 (259)

SIDH Hybrid Schemes with Classical Component Based on the Discrete Logarithm Problem over Finite Field Extension [PDF]

International Journal of Electronics and Telecommunications, 2020
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, Elżbieta Burek, Łukasz Dzierzkowski   +2 more
doaj   +1 more source

DLP in semigroups: Algorithms and lower bounds

Journal of Mathematical Cryptology, 2022
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

Logarithm of the Discrete Fourier Transform

International Journal of Mathematics and Mathematical Sciences, 2007
The discrete Fourier transform defines a unitary matrix operator. The logarithm of this operator is computed, along with the projection maps onto its eigenspaces. A geometric interpretation of the discrete Fourier transform is also given.
Michael Aristidou, Jason Hanson
doaj   +1 more source

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

Logarithm of multivector in real 3D Clifford algebras

Nonlinear Analysis, 2023
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

Pairing-Free for Public Key Encryption With Equality Test Scheme

IEEE Access, 2021
The modular exponentiation has been proved better in terms of computational efficiency as compared to bilinear pairing. Therefore, discrete logarithm, a concept of modular exponentiation may be incorporated to present improved security schemes. With this
Huijun Zhu, Licheng Wang, Haseeb Ahmad, Dong Xie   +3 more
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

Cryptanalysis of the cryptosystems based on the generalized hidden discrete logarithm problem [PDF]

Computer Science Journal of Moldova
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

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem

Journal of Mathematical Cryptology, 2020
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh, Kosters Michiel, Petit Christophe, Yeo Sze Ling, Yun Yang   +4 more
doaj   +1 more source

Computing Small Discrete Logarithms Faster [PDF]

, 2012
Computations of small discrete logarithms are feasible even in "secure" groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree-2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption.
Bernstein, D.J., Lange, T.
openaire   +2 more sources