Yhn HealthNutrition first seen 5 d ago, last 16 h ago, peak #10
Paper Claims Deterministic Polynomial-Time Integer Factoring
Original: Deterministic Factoring in Time N^O(1)
A new paper on Hexagon Math proposes a deterministic algorithm for factoring integers in time N^O(1), which would be a landmark result in computational number theory and cryptography, since no deterministic polynomial-time factoring method is known. Readers are discussing the claim and scrutinising the proof for validity.
Why now: A claimed polynomial-time deterministic factoring algorithm would undermine RSA and overturn long-standing assumptions, prompting intense scrutiny.
Hexagon MathRSAinteger factorizationcryptography
Evidence
- Deterministic Factoring in Time N^O(1) · one-punch · 15
API: https://socialmediatrends-api.osmike.com/v1/trends/4437846