Results 121 to 130 of about 3,524 (301)
Finding discrete logarithms with a set orbit distinguisher [PDF]
We consider finding discrete logarithms in a group $\GG$ when the help of an algorithm $D$ that distinguishes certain subsets of $\GG$ from each other is available.
Robert P. Gallant
core
There are well-known subexponential algorithms for finding discrete logarithms over finite fields. However, the methods which underlie these algorithms do not appear to be easily adaptable for finding discrete logarithms in the groups associated with ...
Adleman, Leonard M. +2 more
core +1 more source
Automated poultry processing lines still rely on humans to lift slippery, easily bruised carcasses onto a shackle conveyor. Deformability, anatomical variance, and hygiene rules make conventional suction and scripted motions unreliable. We present ChicGrasp, an end‐to‐end hardware‐software co‐designed imitation learning framework, to offer a ...
Amirreza Davar +8 more
wiley +1 more source
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders
We generalize and improve the schemes of [4]. We introduce analogues of exponentiation and discrete logarithms in the principle cycle of real quadratic orders. This enables us to implement many cryptographic protocols based on discrete logarithms, e.g. a
Johannes Buchmann +5 more
core
Factor Base Discrete Logarithms in Kummer Extensions [PDF]
. The discrete logarithm over finite fields of small character-istic can be solved much more efficiently than previously thought. This algorithmic breakthrough is based on heuristic polynomial time algo-rithms to compute the factor base discrete ...
Qi Cheng, Jincheng Zhuang, Dianyan Xiao
core
Computing discrete logarithms with the parallelized kangaroo method
The Pollard kangaroo method computes discrete logarithms in arbitrary cyclic groups. It is applied if the discrete logarithm is known to lie in a certain interval, say [a,b], and then has expected running time O(b−a) group operations.
Teske, Edlyn
core +1 more source
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
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
Computing Discrete Logarithms in F_{3^{6*137}} and F_{3^{6*163}} using Magma [PDF]
We show that a Magma implementation of Joux\u27s L[1/4+o(1)] algorithm can be used to compute discrete logarithms in the 1303-bit finite field F_{3^{6*137}} and the 1551-bit finite field F_{3^{6*163}} with very modest computational resources. Our F_{3^{6*
Alfred Menezes +3 more
core
Improvement of signature scheme based on factoring and discrete logarithms
Laih and Kuo proposed two efficient signature schemes based on discrete logarithms and factorization. However, their schemes require many keys for a signing document.
Hwang, M.S., Li, L.H., Tzeng, S.F.
core +1 more source
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

