Results 261 to 270 of about 10,154 (300)
BeamCraft: Deep Reinforcement Learning-DrivenMulti-Objective Beamforming for ISAC
Dao DN, Miao Y.
europepmc +1 more source
On the Semidirect Discrete Logarithm Problem in Finite Groups [PDF]
We present an efficient quantum algorithm for solving the semidirect discrete logarithm problem (SDLP) in any finite group. The believed hardness of the semidirect discrete logarithm problem underlies more than a decade of works constructing candidate post-quantum cryptographic algorithms from non-abelian groups. We use a series of reduction
Christopher Battarbee +12 more
openaire +3 more sources
Recent progress on the elliptic curve discrete logarithm problem [PDF]
Designs, Codes, and Cryptography, 2015 International audienceWe survey recent work on the elliptic curve discrete logarithm problem. In particular we review index calculus algorithms using summation polynomials, and claims about their ...
Steven D Galbraith +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Discrete Logarithm Problem
1993There are many public-key cryptosystems whose security lies in the presumed intractability of the discrete logarithm problem in some group G. The discrete logarithm problem has received a great deal of attention in recent years, and numerous algorithms which use a variety of techniques have been devised.
Ian F. Blake +4 more
openaire +2 more sources
The Discrete-Logarithm Problem with Preprocessing
2018This paper studies discrete-log algorithms that use preprocessing. In our model, an adversary may use a very large amount of precomputation to produce an “advice” string about a specific group (e.g., NIST P-256). In a subsequent online phase, the adversary’s task is to use the preprocessed advice to quickly compute discrete logarithms in the group ...
Henry Corrigan-Gibbs, Dmitry Kogan
openaire +2 more sources
The discrete logarithmic Minkowski problem for q-capacity
Journal of Mathematical Analysis and Applications, 2022For a compact set \(K\) in the \(n\)-dimensional Euclidean space \(\mathbb{R}^n\) and for \(1 < q < n\), the electrostatic \(q\)-capacity \(C_q(K)\) of \(K\) is defined as the quantity \[ C_q(K) = \inf \left\{ \int_{\mathbb{R}^n} |\nabla u|^{q} dx : u \in C_c^{\infty}(\mathbb{R}^n) \hbox{ and } u \geq \chi_K \right\} \] where \(C_c^{\infty}(\mathbb{R ...
Wei Wang, Rigao He
openaire +2 more sources
Discrete Logarithm Problems with Auxiliary Inputs
Journal of Cryptology, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An Improved Algorithm for Discrete Logarithm Problem
2009 International Conference on Environmental Science and Information Application Technology, 2009The difficulty in solving the discrete logarithm problem (DLP) is very important to the cryptography since it is widely used in signature schemes, message encryption, authentication, and so on. The baby-step giant-step algorithm is a series of well-defined steps to compute the discrete logarithm, but its gigantic storage cost is an obvious disadvantage.
Jun Zhang, LiQun Chen
openaire +1 more source
The Discrete Logarithm Problem in non-representable rings. [PDF]
IACR Cryptol. ePrint Arch., 2012 Bergman\u27s Ring $E_p$, parameterized by a prime number $p$, is a ring with $p^5$ elements that cannot be embedded in a ring of matrices over any commutative ring. This ring was discovered in 1974.
Matan Banin, Boaz Tsaban
openaire +3 more sources
Signature Calculus and Discrete Logarithm Problems
2006Index calculus has been successful in many cases for treating the discrete logarithm problem for the multiplicative group of a finite field, but less so for elliptic curves over a finite field. In this paper we seek to explain why this might be the case from the perspective of arithmetic duality and propose a unified method for treating both problems ...
Ming-Deh A. Huang, Wayne Raskind
openaire +1 more source