Block Ciphers: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Block Ciphers (Block Ciphers)}} == Description == A block cipher is a pair of functions $E: \{0, 1\}^k \times \{0, 1\}^n \rightarrow \{0, 1\}^n$ and $D: \{0, 1\}^k \times \{0, 1\}^n \rightarrow \{0, 1\}^n$ that encode and decode a length $n$ string with a length $k$ key. == Parameters == <pre>n: text length (block size) k: key length</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Ye...")
 
No edit summary
Line 6: Line 6:
== Parameters ==  
== Parameters ==  


<pre>n: text length (block size)
n: text length (block size)
k: key length</pre>
 
k: key length


== Table of Algorithms ==  
== Table of Algorithms ==  

Revision as of 13:03, 15 February 2023

Description

A block cipher is a pair of functions $E: \{0, 1\}^k \times \{0, 1\}^n \rightarrow \{0, 1\}^n$ and $D: \{0, 1\}^k \times \{0, 1\}^n \rightarrow \{0, 1\}^n$ that encode and decode a length $n$ string with a length $k$ key.

Parameters

n: text length (block size)

k: key length

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Lucifer / DES 1976 $O(n)$ $O(n)$? Exact Deterministic
IDEA 1991 $O(n)$ $O(n)$? Exact Deterministic
RC5 1994 $O(n)$ $O(k+rw)$? Exact Deterministic Time
Rijndael / AES 2001 $O(n)$ $O(n)$? Exact Deterministic Time
Blowfish 1993 $O(n)$ $O(n)$? Exact Deterministic Time