Results 61 to 70 of about 6,164,294 (286)
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
Advanced Robotics Research, EarlyView.A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source
Algorithms for Solving the Discrete Logarithm Problem [PDF]
, 2014 In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard\u27s kangaroo algorithm are two algorithms that attempt to solve discrete
Whaley, Ryan Edward
core +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
Fusion Discrete Logarithm Problems
CoRR, 2010 The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of candidate algebraic structures which permit implementing the algorithms. In order to extend the applicability of discrete-
Martin Schaffer, Stefan Rass
openaire +3 more sources
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 +4 more sources
Global Duality, Signature Calculus and the Discrete Logarithm Problem [PDF]
LMS Journal of Computation and Mathematics, 2009 AbstractWe develop a formalism for studying the discrete logarithm problem for the multiplicative group and for elliptic curves over finite fields by lifting the respective group to an algebraic number field and using global duality. One of our main tools is thesignatureof a Dirichlet character (in the multiplicative group case) or principal ...
Ming-Deh A. Huang, Wayne Raskind
openaire +2 more sources
, 2010 V diplomskem delu obravnavamo problem diskretnega logaritma. Problem diskretnega logaritma je matematično-računski problem, ki služi kot osnova kriptografskim protokolom. Pri diskretnih logaritmih operiramo znotraj multiplikativne grupe G. Problem od nas
Petelinek, Barbara
core
The problem of discrete logarithm
, 2014 162 σ.Σκοπός της εργασίας αυτής είναι η περιγραφή του προβλήματος του διακριτού λογάριθμου, αλλά και η παρουσίαση αλγορίθμων που μπόρουν υπό προϋποθέσεις να λύσουν το πρόβλημα.
Μαραγκουδάκης, Μανώλης Δ. +1 more
core +1 more source
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
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