• Email@lemmy.world
    link
    fedilink
    English
    arrow-up
    5
    ·
    edit-2
    1 hour ago

    It changes almost nothing. Testing a prime was already known, though this may prove another algorithm can too (Miller-Rabin requires extended RH). RSA cares about factorization not primality testing (and RSA does not nearly represent cryptography). RH solved proves a large number of statements that depended on it, but they are considered routine because RH was already assumed to be true.