Jehochman

:: I know that the [[general number field sieve]] is an ugly algorithm that is sub-exponential, supra-polynomial. My suspicion is that there's something better, perhaps O(n^6) where n = log(N), but that's pure conjecture. [[User:Jehochman|Jehochman]] ^{[[User talk:Jehochman|Talk]]} 21:46, 23 January 2023 (UTC)

:::Sounds ok. My own thoughts would be to try to do some preliminary theorem-proof studies and then to try to target something sub-quartic or even sub-cubic, to address the sixth order polynomial complexity currently found in the general number field sieve. I'm assuming that you have a fast algorithm for computing remainders for the division of one integer by another when the integers are over 200 or 300 digits long, and that you might be able to implement and test the theorem-proofs once I've set them up. My research is done mostly at Columbia which might make it easier to communicate results if this sounds like it might be interesting. [[User:ErnestKrause|ErnestKrause]] ([[User talk:ErnestKrause|talk]]) 17:13, 24 January 2023 (UTC)