Quantum hack isn’t ready yet.
For example, the widely used RSA algorithm relies on the fact that multiplying two prime numbers to generate a large encryption key is easy, while finding those original prime factors when you only have the encryption key is very difficult. News A GROUP of researchers has claimed that quantum comput...
| Publicado en: | New Scientist Vol. 257; no. 3421; pp. 15 - 16 |
|---|---|
| Autor principal: | |
| Formato: | Journal Article |
| Publicado: |
New Scientist Ltd.
1/14/2023
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=161262697&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 161262697 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 02624079 NSI jtl: New Scientist issn: 02624079 maglogo: N pubinfo: dt: 1/14/2023 vid: 257 iid: 3421 pid: 39714 pub: New Scientist Ltd. artinfo: ui: 161262697 10.1016/s0262-4079(23)00052-0 161262697 ppf: 15 ppct: 1 formats: tig: atl: Quantum hack isn’t ready yet. aug: au: Sparkes, Matthew sug: ab: For example, the widely used RSA algorithm relies on the fact that multiplying two prime numbers to generate a large encryption key is easy, while finding those original prime factors when you only have the encryption key is very difficult. News A GROUP of researchers has claimed that quantum computers can now crack the encryption we use to protect emails, bank accounts and other sensitive data. But quantum computers can exploit the unusual properties of quantum physics to speed up some calculations and will probably render current encryption techniques obsolete once the hardware is sufficiently powerful and accurate. pubtype: Periodical doctype: Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|