Results 61 to 70 of about 8,170 (257)
Hard Instances of the Constrained Discrete Logarithm Problem [PDF]
, 2006 The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set.
Ilya Mironov +2 more
openaire +3 more sources
Advanced Robotics Research, EarlyView.This work presents a robotic control method for human–robot collaborative assembly based on a biomechanics‐constrained digital human model. Reinforcement learning is used to generate physiologically plausible human motion trajectories, which are integrated into a virtual environment for robot control learning.
Bitao Yao +4 more
wiley +1 more source
Digital signature scheme with doubled verification equation [PDF]
Computer Science Journal of Moldova, 2020 A novel design of the signature schemes based on the hidden discrete logarithm problem is proposed, which is characterized in using special criterion oriented to providing security to potential quantum attacks.
D.N. Moldovyan +2 more
doaj
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
Advanced Robotics Research, EarlyView.A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang +5 more
wiley +1 more source
On the discrete logarithm problem
, 2008 Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.
openaire +2 more sources
Solid Harmonic Wavelet Bispectrum for Image Analysis
Advanced Science, EarlyView.The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown +3 more
wiley +1 more source
Post-quantum public key-agreement scheme based on a new form of the hidden logarithm problem [PDF]
Computer Science Journal of Moldova, 2019 A new form of the hidden discrete logarithm problem, proposed as primitive of the post-quantum public-key cryptoschemes, is defined over the 6-dimensional finite non-commutative associative algebra with a large set of the left-sided global units.
D.N. Moldovyan
doaj
On the first fall degree of summation polynomials
Journal of Mathematical Cryptology, 2019 We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.
Kousidis Stavros, Wiemers Andreas
doaj +1 more source
Survey on SAP and its application in public-key cryptography
Journal of Mathematical Cryptology, 2020 The concept of the semigroup action problem (SAP) was first introduced by Monico in 2002. Monico explained in his paper that the discrete logarithm problem (DLP) can be generalized to SAP. After defining the action problem in a semigroup, the concept was
Goel Neha, Gupta Indivar, Dass B. K.
doaj +1 more source
ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM
Prikladnaya diskretnaya matematika, 2016 Summary: Generic-case approach to algorithmic problems was suggested by \textit{I. Kapovich} et al. [J. Algebra 264, No. 2, 665--694 (2003; Zbl 1041.20021)]. This approach studies behaviour of an algorithm on typical (almost all) inputs and ignores the rest of inputs.
openaire +2 more sources