Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision |
| groverovos_algorithmos [2026/04/02 21:12] – created danetiska | groverovos_algorithmos [2026/04/02 21:13] (current) – [Grover's algorithm] danetiska |
|---|
| ===== Groverovos algorithmos ===== | ===== Groverovos algorithmos ===== |
| |
| [[https://en.wikipedia.org/wiki/Grover's_algorithm|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. | [[https://en.wikipedia.org/wiki/Grover's_algorithm|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 ===== | ===== Grover's algorithm ===== |
| |
| [[https://en.wikipedia.org/wiki/Grover's_algorithm|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. | [[https://en.wikipedia.org/wiki/Grover's_algorithm|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. |
