1 citations · 1 across the 12 of their papers we have counts for
12 papers
Factoring Odd Integers without Multiplication and Division
Charles Sauerbier
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an i…
Prime Factoring and The Complexity Of
Charles Sauerbier
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; in…
A Polynomial Diophantine Generator Function for Integer Residuals
Charles Sauerbier
Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals [1,Floor(n^0.5…
Computing a Frobenius Coin Problem decision problem in O(n^2)
Charles Sauerbier
Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denominat…
Computing a Discrete Logarithm in O(n^3)
Charles Sauerbier
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduc…
Discovery of Elliptic Curve Cryptographic Private Key in O(n)
Charles Sauerbier
An algorithm is presented that in context of public key use of Elliptic Curve Cryptography allows discovery of the private key in worst case O(n).