▲ 130 ▼ Mathematician warns US spies may be weakening next-gen encryption (www.newscientist.com) submitted 2 years ago by throws_lemy@lemmy.nz to c/technology@beehaw.org 27 comments fedilink hide all child comments
[–] furrowsofar@beehaw.org 8 points 2 years ago (1 child) That is the problem with encryption. It only provides security over a period of time. Always better to keep data on your own hardware in your own place. Quantum is also more of an issues for public key crypto. Symmetric key crypto is different. permalink fedilink source parent hideshow 2 child comments replies: [–] snaptastic@beehaw.org 7 points 2 years ago (2 children) Could you explain more on that last point? Sounds really interesting. permalink fedilink source parent hideshow 4 child comments replies: [–] Godort@lemm.ee 12 points 2 years ago (1 child) Asymmetric key exchange works by utilising a complex math equation involving massive exponents that is easy to run to get an answer, but very hard to use that answer to get the numbers you started with. With traditional computers, you essentially need to try every combination of numbers through trial and error to get the starting values. Quantum computers are almost purpose built for this kind of math and can solve those types of problems exponentially faster than traditional computers. However, for a symmetric key, there isn't an exchange that can be attacked, both sides already know the key. permalink fedilink source parent hideshow 2 child comments replies: [–] xylem@beehaw.org 2 points 2 years ago There is still a quantum attack against symmetric key crypto like AES, but it just reduces the effective key size by half. If you use long enough keys (256 bits) you're still fine. permalink fedilink source parent [–] furrowsofar@beehaw.org 4 points 2 years ago Others know a lot more about this then I do. The short answer is that some problems that are hard to solve now can be easily solved with quantum computers. Factorization of large integers is one of those things that is easily solved and public key crypto is based on that sort of problem. Hence the panic. Symmetric key crypto is not. I think it comes down to just because quantum computers can solve some problems easily it does not mean they can solve all problems easily. Each situation needs to be looked at. permalink fedilink source parent
[–] snaptastic@beehaw.org 7 points 2 years ago (2 children) Could you explain more on that last point? Sounds really interesting. permalink fedilink source parent hideshow 4 child comments replies: [–] Godort@lemm.ee 12 points 2 years ago (1 child) Asymmetric key exchange works by utilising a complex math equation involving massive exponents that is easy to run to get an answer, but very hard to use that answer to get the numbers you started with. With traditional computers, you essentially need to try every combination of numbers through trial and error to get the starting values. Quantum computers are almost purpose built for this kind of math and can solve those types of problems exponentially faster than traditional computers. However, for a symmetric key, there isn't an exchange that can be attacked, both sides already know the key. permalink fedilink source parent hideshow 2 child comments replies: [–] xylem@beehaw.org 2 points 2 years ago There is still a quantum attack against symmetric key crypto like AES, but it just reduces the effective key size by half. If you use long enough keys (256 bits) you're still fine. permalink fedilink source parent [–] furrowsofar@beehaw.org 4 points 2 years ago Others know a lot more about this then I do. The short answer is that some problems that are hard to solve now can be easily solved with quantum computers. Factorization of large integers is one of those things that is easily solved and public key crypto is based on that sort of problem. Hence the panic. Symmetric key crypto is not. I think it comes down to just because quantum computers can solve some problems easily it does not mean they can solve all problems easily. Each situation needs to be looked at. permalink fedilink source parent
[–] Godort@lemm.ee 12 points 2 years ago (1 child) Asymmetric key exchange works by utilising a complex math equation involving massive exponents that is easy to run to get an answer, but very hard to use that answer to get the numbers you started with. With traditional computers, you essentially need to try every combination of numbers through trial and error to get the starting values. Quantum computers are almost purpose built for this kind of math and can solve those types of problems exponentially faster than traditional computers. However, for a symmetric key, there isn't an exchange that can be attacked, both sides already know the key. permalink fedilink source parent hideshow 2 child comments replies: [–] xylem@beehaw.org 2 points 2 years ago There is still a quantum attack against symmetric key crypto like AES, but it just reduces the effective key size by half. If you use long enough keys (256 bits) you're still fine. permalink fedilink source parent
[–] xylem@beehaw.org 2 points 2 years ago There is still a quantum attack against symmetric key crypto like AES, but it just reduces the effective key size by half. If you use long enough keys (256 bits) you're still fine. permalink fedilink source parent
[–] furrowsofar@beehaw.org 4 points 2 years ago Others know a lot more about this then I do. The short answer is that some problems that are hard to solve now can be easily solved with quantum computers. Factorization of large integers is one of those things that is easily solved and public key crypto is based on that sort of problem. Hence the panic. Symmetric key crypto is not. I think it comes down to just because quantum computers can solve some problems easily it does not mean they can solve all problems easily. Each situation needs to be looked at. permalink fedilink source parent