Sifer blok: Perbezaan antara semakan
Kandungan dihapus Kandungan ditambah
Pengemasan. |
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.8 |
||
Baris 4:
== Definisi ==
Suatu penguncian blok terdiri dari sepasang [[algoritma]]: penyulitan {{var serif|E}} dan dekripsi {{var serif|D}}.<ref>{{cite book |last1=Cusick |first1=Thomas W. |last2=Stanica |first2=Pantelimon |year=2009 |title=Cryptographic Boolean functions and applications |publisher=Academic Press |isbn=978-0-1237-4890-4 |pp=158–159 |url=https://books.google.com/books?id=OAkhkLSxxxMC&pg=PA158}}</ref> Kedua algoritma menerima dua masukan: blok data berukuran {{var serif|n}} bit dan [[Kunci (kriptografi)|kunci]] berukuran {{var serif|k}} bit. Algoritma dekripsi ialah penyongsangan fungsi enkripsi, iaitu {{math|{{var serif|D}} = {{var serif|E}}<sup>-1</sup>}}. Secara matematis,<ref name=menezes1996>{{cite book |last1=Menezes |first1=Alfred J. |last2=van Oorschot |first2=Paul C. |last3=Vanstone |first3=Scott A. |year=1996 |title=Handbook of Applied Cryptography |publisher=CRC Press |chapter=Chapter 7: Block Ciphers |isbn=0-8493-8523-7 |url=http://cacr.uwaterloo.ca/hac/ |access-date=2012-07-15 |archive-date=2021-02-03 |archive-url=https://web.archive.org/web/20210203194011/https://cacr.uwaterloo.ca/hac/ |url-status=dead }}</ref><ref name=bellare2005>{{citation |last1=Bellare |first1=Mihir |last2=Rogaway |first2=Phillip |date=11 Mei 2005 |title=Introduction to Modern Cryptography |format=Catatan kuliah |url=http://www.cs.ucdavis.edu/~rogaway/classes/227/spring05/book/main.pdf}}, bab 3.</ref> suatu penguncian blok didefinisikan oleh sebuah fungsi enkripsi
: <math>E_K(P) = E(K, P): \{0, 1\}^k \times \{0, 1\}^n \rightarrow \{0, 1\}^n</math>
| |||