1 citations · 1 across the 12 of their papers we have counts for
4 papers · 1 filter
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).
Computing an Integer Prime Factoring in O(n^2.5)
Charles Sauerbier
Paper is withdrawn. On review the paper contributes little of significance. The runtime analysis of the algorithms presented, while correct in terms of number of operations, does n…
Answering Hilbert's 1st Problem
Charles Sauerbier
Hilbert's first problem is of importance in relation to work being done in computational systems. It is the question of equipollence of natural and real numbers. By construction eq…