Informatika és tudomány

  • Epikurosz
    #96
    Na, felizgattatok, és beleolvastam:
    "A theoretical hardware device named TWIRL and described by Shamir and Tromer in 2003 called into question the security of 1024 bit keys. It is currently recommended that n be at least 2048 bits long.

    In 1994, Peter Shor published Shor's algorithm, showing that a quantum computer could in principle perform the factorization in polynomial time. However, quantum computation is still in the early stages of development and may never prove to be practical." (wiki)

    Amúgy, érdekes. :-)