Results 241 to 250 of about 6,164,294 (286)

Reinforcement learning-controlled differential evolution with L-BFGS refinements. [PDF]

PLoS One
Cao Y, Wu B, Wen M.
europepmc   +1 more source

An Alternative Finite Difference WENO-Like Scheme with Physical Constraint Preservation for Divergence-Preserving Hyperbolic Systems. [PDF]

Commun Appl Math Comput
Balsara DS, Bhoriya D, Shu CW.
europepmc   +1 more source

The Gittins Index for a Transparent One-Armed Bandit with a Continuous Payoff Spectrum in Equilibrium States. [PDF]

Entropy (Basel)
Makowski M, Piotrowski EW, Cieśliński JL.   +2 more
europepmc   +1 more source

Estimation of Blood Velocity from TOF-MRA Arterial Centerlines: Theory, Simulation, and Inverse Solution. [PDF]

Bioengineering (Basel)
Faiyaz A, Uddin MN, Schifitto G.
europepmc   +1 more source

Bio-Inspired Event-Based Visual Servoing for Ground Robots. [PDF]

IEEE Control Syst Lett
Mordad M, Behzad K, Biswas D, Cowan NJ, Siami M.   +4 more
europepmc   +1 more source

A well-defined local continuum damage model with softening via convexification and entropic regularization

Lauff C, Schlichting A, Böhlke T, Schneider M.   +3 more
europepmc   +1 more source

Generic Hardness of the Multiple Discrete Logarithm Problem [PDF]

Lecture Notes in Computer Science, 2015
We study generic hardness of the multiple discrete logarithm problem, where the solver has to solve \(n\) instances of the discrete logarithm problem simultaneously. There are known generic algorithms which perform \(O(\sqrt{np})\) group operations, where \(p\) is the group order, but no generic lower bound was known other than the trivial bound.
Aaram Yun
exaly   +7 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 Galbraith, Pierrick Gaudry
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

The Discrete Logarithm Problem

1993
In [Dif76] Diffie and Hellman propose a public key distribution system which is based on the apparent difficulty of computing logarithms over the finite field GF (p), p prime. The reader, who is not familiar with the theory of finite fields is referred to Appendix B. Let α be a primitive element of GF(p).
Ian F. Blake, XuHong Gao, Ronald C. Mullin, Scott A. Vanstone, Tomik Yaghoobian   +4 more
openaire   +2 more sources