Results 61 to 70 of about 10,154 (300)
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 +2 more sources
Learning Highly Dynamic Skills Transition for Quadruped Jumping Through Constrained Space
Advanced Robotics Research, EarlyView.A quadruped robot masters dynamic jumps through constrained spaces with animal‐inspired moves and intelligent vision control. This hierarchical learning approach combines imitation of biological agility with real‐time trajectory planning. Although legged animals are capable of performing explosive motions while traversing confined spaces, replicating ...
Zeren Luo +6 more
wiley +1 more source
Developed Protocol for Key Exchange Based on Irreducible Polynomial [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 The Aim of this paper is to design a protocol for key exchanging to work on the available computers for different data security application. This paper proposed idea to modify the Diffie-Hellman key exchange by using truncated polynomial instead of ...
Abdul Monem S. Rahma +2 more
doaj +1 more source
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem [PDF]
Algorithmica, 2006 It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elliptic curves over finite fields to global fields. We explore the possibility of circumventing the problem of explicitly lifting points by investigating whether partial ...
Qi Cheng 0001, Ming-Deh A. Huang
openaire +1 more source
Advanced Robotics Research, EarlyView.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
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
A new approach to the discrete logarithm problem with auxiliary inputs [PDF]
LMS Journal of Computation and Mathematics, 2016 The aim of the discrete logarithm problem with auxiliary inputs is to solve for ${\it\alpha}$, given the elements $g,g^{{\it\alpha}},\ldots ,g^{{\it\alpha}^{d}}$ of a cyclic group $G=\langle g\rangle$, of prime order $p$. The best-known algorithm, proposed by Cheon in 2006, solves for ${\it\alpha}$ in the case where $d\mid (p\pm 1)$, with a running ...
Jung Hee Cheon, Taechan Kim 0001
openaire +1 more source
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
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
Proxy Blind Signature Scheme based on Discrete Logarithm Problem and Elliptic Curve Discrete Logarithm Problem [PDF]
, 2010 In some applications, it is necessary to protect the privacy of the content of user from signer. Proxy blind signature can be used in these applications which combine the properties of both proxy signature and blind signature.
Aung Nway Oo, Ni Lar Thein
core