Results 71 to 80 of about 2,924 (299)
Smooth Subsum Search: A heuristic for practical integer factorization
The two currently fastest general-purpose integer factorization algorithms are the Quadratic Sieve and the Number Field Sieve. Both techniques are used to find so-called smooth values of certain polynomials, i.e., values that factor completely over a set
Hittmeir, Markus
core +2 more sources
Factorization of cubic vertices involving three different higher spin fields
We derive a class of cubic interaction vertices for three higher spin fields, with integer spins λ1, λ2, λ3, by closing commutators of the Poincaré algebra in four-dimensional flat spacetime.
Y.S. Akshay, Sudarshan Ananth
doaj +1 more source
On Factorization of Integers with Restrictions on the Exponents
For a fixed k ∈ N we consider a multiplicative basis in N such that every n ∈ N has the unique factorization as product of elements from the basis with the exponents not exceeding k. We introduce the notion of k-multiplicativity of arithmetic functions, and study several arithmetic functions naturally defined in k-arithmetics.
Litsyn, Simon, Shevelev, Vladimir
openaire +3 more sources
Continuum Mechanics Modeling of Flexible Spring Joints in Surgical Robots
A new mechanical model of a tendon‐actuated helical extension spring joint in surgical robots is built using Cosserat rod theory. The model can implicitly handle the unknown contacts between adjacent coils and numerically predict spring shapes from straight to significantly bent under actuation forces.
Botian Sun +3 more
wiley +1 more source
Discrete Logarithm and Integer Factorization using ID-based Encryption
Shamir proposed the concept of the ID-based Encryption (IBE) in [1]. Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key.
Meshram, Chandrashekhar
core +1 more source
A Simple Improvement for Integer Factorizations with Implicit Hints [PDF]
In this paper, we describe an improvement of integer factorization of k RSA moduli Ni=piqi (1≤i≤k) with implicit hints, namely all pi share their t least significant bits. May et al.
Ryuto, Heiwa +2 more
core +1 more source
A Reduction of Integer Factorization to Modular Tetration [PDF]
Let [Formula: see text]. By [Formula: see text] and [Formula: see text], we denote the [Formula: see text] th iterate of the exponential function [Formula: see text] evaluated at [Formula: see text], also known as tetration. We demonstrate how an algorithm for evaluating tetration modulo natural numbers [Formula: see text] could be used to compute the
openaire +3 more sources
On the factorization of consecutive integers [PDF]
Let \(n\) and \(k\) be positive integers with \(n \geq 2k\), and write \(\binom{n}{k} = UV\), where the largest prime factor of \(U\) is at most \(k\) and all prime factors of \(V\) exceed \(k\). \textit{E. F. Ecklund jun., R. B. Eggleton, P. Erdős} and \textit{J. L. Selfridge} [J. Aust. Math. Soc., Ser.
Bennett, M. A. +2 more
openaire +2 more sources
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
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
Integer Factoring with Unoperations
This work introduces the notion of unoperation $\mathfrak{Un}(\hat{O})$ of some operation $\hat{O}$. Given a valid output of $\hat{O}$, the corresponding unoperation produces a set of all valid inputs to $\hat{O}$ that produce the given output. Further, the working principle of unoperations is illustrated using the example of addition.
openaire +2 more sources

