DanuWiki

Groverovos algorithmos esti cryptographiskos algorithmos jos megti rupnuni clavim ordenes $N$ en tempori $\sqrt{N}$. Pro exemplom, clavis 128 bitom megti rupnumeni en $2^64$ iteratzionsu; clavis 256 bitom en $2^128$ iteratzionsu; etc. Defensa proti sjom algorithmom esti simplice djystre duplicaieni clavim.

Grover's algorithm is a cryptographic algorithm that can break a key of order $N$ in time $\sqrt{N}$. For example, a key of 128 bits can be broken in $2^64$ iterations; a key of 256 bits in $2^128$ iterations; etc. The defense against this algorithm is to simply double the key.