With the power of quantum computing, how will we defend it against the cracking of complex passwords?
With the power of quantum computing, how will we defend it against the cracking of complex passwords?
Gabriel Reyes
Other urls found in this thread:
openquantumsafe.org
en.wikipedia.org
twitter.com
Jayden Perry
just make them even more complex
David Green
Just use quantum encryption.
Angel Johnson
It can only halve the complexity, so it's basically not worth worrying about.
Cameron Ward
I need a quick rundown on quantum computing and how it differs from normal computers
Hudson Price
Normal computers exist today and can solve actual problems quickly. Quantum computers may or may not exist and in any case can't solve any problems usefully yet, and maybe never will. They might be a scam altogether.
Sebastian Murphy
Dylan Moore
>open quantum safe
>open safe
A name you can trust.
Oliver Reed
>The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem.
Basically you're fucked. For all we know they could be in use secretly right now.
Grayson Jones
>All of these problems can be easily solved on a sufficiently powerful quantum computer running Shor's algorithm. Even though current, publicly known, experimental quantum computers lack processing power to break any real cryptographic algorithm, many cryptographers are designing new algorithms to prepare for a time when quantum computing becomes a threat.
Daniel Sanders
The one time pad is fundamentally uncrackable, but you must keep the key a secret.
Andrew Brown
>cracking of complex passwords
Literally the easiest thing to defend against. Cracking passwords is O(N) on normal computers, while it is only O(sqrt(N)) on quantum computers, where N is the number of possible passwords (e.g. 2^128 for a 128-bit password). This means that cracking a 128-bit password with a quantum computer is like cracking a 64-bit password on a normal one, because sqrt(2^128) = 2^64. The solution is therefore pretty simple: just ~double the length of your password/hash and you're good to go.
Lucas Reyes
it only affects public key crypto.
literally everything else is safe
Chase Brooks
nice
John Bailey
t. brainlet
Jordan Nelson
Or just lock them out after 3 attempts
simpler shit, really
Anthony Johnson
Why does this computer makes a soiboi expression face lmao?
Jack Carter
soiboyism is a parasitical disease
Luis Russell
Hashes are usually obtained through database leaks, and crackers are free to do whatever they want with them until they manage to compute the password to use in the actual service.
Brandon White
No, you're the brainlet. FYI, the greatest amount of completely entangled qubits we've reached so far is 20.
Easton Anderson
Quantum computers encode the states 1 and 0 into some quantum phenomenon, such as the spin of an electron or polarization of photons. While in a quantum state qubit can exist in superposition as a probability distribution of whether or not it will be 1 or 0 once you measure it. Quantum entanglement allows qubits to affect the results of other qubits, this allows you to expoentially increase the number of possible superpositions. The difference between classical bits and qubits is that with 2 classical bits you can have possible states 00, 01, 10, 11 but can only be in one of those given states at any given time. Qubits that are entangled can be in any of those states but through superposition they can exist as some probability to measuring every single one of those states. Quantum parallelism applies because performing an operation on a system operates on every single possible superposition at the same time. The goal in quantum algorithms is generally to make the probability of one solution dominate the others so you can run every operation in parallel and the result will be the correct answer with high probability.
Quantum computers are still years off because they're really difficult to work with. They need to be under radiation shielding, magnetic shielding, and kept at about 0.015 Kelvin to maintain quantum state. Also quantum computing is challenging because all of the operations need to be reversible (Because if you can't reverse physics nothing makes sense. Imagine throwing a ball somewhere and not being able to throw it back). So normal boolean gates don't work because .
Nathan Morris
Qubits aren't ordinary bits. With every additional qubit, the computational power of the machine doubles.
Dominic Johnson
Unicode passwords
Austin Roberts
A 128 qubit computer can crack that in O(1)
Xavier Hill
>So normal boolean gates don't work because .
user...? You alright?