• Breaking News

    Thursday, September 27, 2018

    Cryptography If mathematicians found a computationally efficient way to factor semiprime numbers, what backup cryptographic algorithms do we have?

    Cryptography If mathematicians found a computationally efficient way to factor semiprime numbers, what backup cryptographic algorithms do we have?


    If mathematicians found a computationally efficient way to factor semiprime numbers, what backup cryptographic algorithms do we have?

    Posted: 26 Sep 2018 05:39 AM PDT

    As far as I know, most major encryption algorithms are predicated upon semiprimes being incredibly difficult to factor. What happens when that is no longer the case?

    Sorry if this is an elementary question. I am "new" to these concepts, studying for my CISSP now and on the crypto chapters but had some thoughts cross my mind.

    submitted by /u/Tiresauce
    [link] [comments]

    Reflections on trusting SGX

    Posted: 26 Sep 2018 11:16 AM PDT

    No comments:

    Post a Comment