Results 71 to 80 of about 6,164,294 (286)

Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling

open access: yesAdvanced 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

Developed Protocol for Key Exchange Based on Irreducible Polynomial [PDF]

open access: yesمجلة جامعة الانبار للعلوم الصرفة, 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

A new approach to the discrete logarithm problem with auxiliary inputs [PDF]

open access: yesLMS 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

Solid Harmonic Wavelet Bispectrum for Image Analysis

open access: yesAdvanced 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

The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives [PDF]

open access: yes, 2017
summary:We connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic ...
R. Padma   +3 more
core   +1 more source

Data‐Driven Modeling of Composition–Processing–Microstructure Relations for Recycled Aluminum Cast Alloys

open access: yesAdvanced Science, EarlyView.
Interpretable machine learning reveals how composition and processing govern the formation and microstructural burden of Fe‐rich intermetallic compounds in recycled Al–Si–Fe–Mn alloys. By separating morphology selection from morphology‐conditioned burden partitioning, this framework shows that identical Fe contents can yield different intermetallic ...
Jaemin Wang   +2 more
wiley   +1 more source

Practical solving of discrete logarithm problem over prime fields using quantum annealing [PDF]

open access: yes, 2021
This paper investigates how to reduce discrete logarithm problem over prime fields to the QUBO problem to obtain as few logical qubits as possible. We show different methods of reduction of discrete logarithm problem over prime fields to the QUBO problem.
Michał Wroński
core   +1 more source

Digital signature scheme with doubled verification equation [PDF]

open access: yesComputer 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  

Blind signatures based on the discrete logarithm problem [PDF]

open access: yes, 1995
Blind signature schemes, an important cryptographic primitive, are useful in protocols that guarantee the anonymity of the participants. Two new blind signature schemes based on the discrete logarithm problem are presented.
Jan Camenisch   +2 more
openaire   +2 more sources

Security of almost ALL discrete log bits [PDF]

open access: yes, 2005
Let G be a finite cyclic group with generator \alpha and with an encoding so that multiplication is computable in polynomial time. We study the security of bits of the discrete log x when given \exp_{\alpha}(x), assuming that the exponentiation function \
Schnorr, Claus Peter
core  

Home - About - Disclaimer - Privacy