Grand Cru (cipher): Difference between revisions

From Wikipedia, the free encyclopedia

Content deleted Content added

Inline

Latest revision as of 12:27, 26 September 2023

Grand Cru
Allgemein
Designers	Johan Borst
First published	2000
Derived from	Rijndael
Cipher detail
Key sizes	128 bits
Block sizes	128 bits
Structure	Substitution–permutation network
Rounds	10

In cryptography, Grand Cru is a block cipher invented in 2000 by Johan Borst. It was submitted to the NESSIE project, but was not selected.

Grand Cru is a 10-round substitution–permutation network based largely on Rijndael (or AES).^[1] It replaces a number of Rijndael's unkeyed operations with key-dependent ones, in a way consistent with the security purposes of each operation. The intent is to produce a cipher at least as secure as Rijndael, and perhaps much more secure. The block size and key size are both 128 bits, and the key schedule is the same as Rijndael's.

Grand Cru is designed on the principle of multiple layered security.^[2]^[3] It is equivalent to a chain of 4 subciphers with independent keys, such that if 3 of the keys are known, the remaining cipher should still be secure.

References

[edit]

^ Murphy, Sean; White, Juliette (2001-09-23). "Security Evaluation of NESSIE First Phase: 2.4.9 Grand Cru" (PDF). p. 26. Retrieved 2018-09-13.
^ Khan, Azhar Ali; Murtaza, Ghulam (2011-07-15). "Efficient Implementation of Grand Cru with TI C6x+ Processor". Retrieved 2018-09-13.
^ Ghulam Murtaza; Azhar Ali Khan; Syed Wasi Alam; Aqeel Farooqi (2011-04-09). "Fortification of AES with Dynamic Mix-Column Transformation". Retrieved 2018-09-13.

v t e Block ciphers (security summary)
Common algorithms	AES Blowfish DES (internal mechanics, Triple DES) Serpent SM4 Twofish
Less common algorithms	ARIA Camellia CAST-128 GOST IDEA LEA RC5 RC6 SEED Skipjack TEA XTEA
Other algorithms	3-Way Adiantum Akelarre Anubis Ascon BaseKing BassOmatic BATON BEAR and LION CAST-256 Chiasmus CIKS-1 CIPHERUNICORN-A CIPHERUNICORN-E CLEFIA CMEA Cobra COCONUT98 Crab Cryptomeria/C2 CRYPTON CS-Cipher DEAL DES-X DFC E2 FEAL FEA-M FROG G-DES Grand Cru Hasty Pudding cipher Hierocrypt ICE IDEA NXT Intel Cascade Cipher Iraqi Kalyna KASUMI KeeLoq KHAZAD Khufu and Khafre KN-Cipher Kuznyechik Ladder-DES LOKI (97, 89/91) Lucifer M6 M8 MacGuffin Madryga MAGENTA MARS Mercy MESH MISTY1 MMB MULTI2 MultiSwap New Data Seal NewDES Nimbus NOEKEON NUSH PRESENT Prince Q RC2 REDOC Red Pike S-1 SAFER SAVILLE SC2000 SHACAL SHARK Simon Speck Spectr-H64 Square SXAL/MBAL Threefish Treyfer UES xmx XXTEA Zodiac
Design	Feistel network Key schedule Lai–Massey scheme Product cipher S-box P-box SPN Confusion and diffusion Round Avalanche effect Block size Key size Key whitening (Whitening transformation)
Attack (cryptanalysis)	Brute-force (EFF DES cracker) MITM Biclique attack 3-subset MITM attack Linear (Piling-up lemma) Differential Impossible Truncated Higher-order Differential-linear Distinguishing (Known-key) Integral/Square Boomerang Mod n Related-key Slide Rotational Side-channel Timing Power-monitoring Electromagnetic Acoustic Differential-fault XSL Interpolation Partitioning Rubber-hose Black-bag Davies Rebound Weak key Tau Chi-square Time/memory/data tradeoff
Standardization	AES process CRYPTREC NESSIE NSA Suite B CNSA
Utilization	Initialization vector Mode of operation Padding

v t e Cryptography
Allgemein	History of cryptography Outline of cryptography Cryptographic protocol Authentication protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key derivation function Digital signature Kleptography Key (cryptography) Key exchange Key generator Key schedule Key stretching Keygen Cryptojacking malware Ransomware Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal channel Encryption Decryption End-to-end encryption Harvest now, decrypt later Information-theoretic security Plaintext Codetext Ciphertext Shared secret Trapdoor function Trusted timestamping Key-based routing Onion routing Garlic routing Kademlia Mix network
Mathematics	Cryptographic hash function Block cipher Stream cipher Symmetric-key algorithm Authenticated encryption Public-key cryptography Quantum key distribution Quantum cryptography Post-quantum cryptography Message authentication code Random numbers Steganography
Kategorie

Retrieved from "https://en.wikipedia.org/w/index.php?title=Grand_Cru_(cipher)&oldid=1177169733"

Kategorie:

Block ciphers

Hidden categories:

@@ Line 1: / Line 1: @@
+{{Short description|Block cipher}}
-{{About|the block cipher|the wine classification|Grand cru (disambiguation){{!}}Grand cru}}
+{{About|the block cipher|other uses|Grand cru (disambiguation){{!}}Grand cru}}
 {{Infobox block cipher
 | name = Grand Cru
@@ Line 7: / Line 8: @@
 | key size = 128 bits
 | block size = 128 bits
-| structure = [[Substitution-permutation network]]
+| structure = [[Substitution–permutation network]]
 | rounds = 10
 | cryptanalysis =
@@ Line 14: / Line 15: @@
 In [[cryptography]], '''Grand Cru''' is a [[block cipher]] invented in 2000 by [[Johan Borst]]. It was submitted to the [[NESSIE]] project, but was not selected.
-Grand Cru is a 10-round [[substitution-permutation network]] based largely on [[Rijndael]] (or AES).<ref>{{cite web
+Grand Cru is a 10-round [[substitution–permutation network]] based largely on [[Rijndael]] (or AES).<ref>{{cite web
 | url=https://www.cosic.esat.kuleuven.be/nessie/deliverables/D13.pdf
-| title=Security Evaluation of NESSIE First Phase: 2.4.9  Grand Cru
+| title=Security Evaluation of NESSIE First Phase: 2.4.9 Grand Cru
 | first1=Sean
 | last1=Murphy
@@ Line 23: / Line 24: @@
 | date=2001-09-23
 | page=26
+| access-date=2018-09-13}}</ref> It replaces a number of Rijndael's unkeyed operations with key-dependent ones, in a way consistent with the security purposes of each operation. The intent is to produce a cipher at least as secure as Rijndael, and perhaps much more secure. The [[block size (cryptography)|block size]] and [[key size]] are both 128 bits, and the [[key schedule]] is the same as [[Rijndael key schedule|Rijndael's]].
-| format=PDF
-| accessdate=2018-09-13}}</ref> It replaces a number of Rijndael's unkeyed operations with key-dependent ones, in a way consistent with the security purposes of each operation. The intent is to produce a cipher at least as secure as Rijndael, and perhaps much more secure. The [[block size (cryptography)|block size]] and [[key size]] are both 128 bits, and the [[key schedule]] is the same as [[Rijndael key schedule|Rijndael's]].
 Grand Cru is designed on the principle of ''multiple layered security''.<ref>{{cite web
@@ Line 34: / Line 34: @@
 | last2=Murtaza
 | date=2011-07-15
-| accessdate=2018-09-13}}</ref><ref>{{cite web
+| access-date=2018-09-13}}</ref><ref>{{cite web
 | url=https://eprint.iacr.org/2011/184
 | title=Fortification of AES with Dynamic Mix-Column Transformation
-| authors=Ghulam Murtaza, Azhar Ali Khan, Syed Wasi Alam, Aqeel  Farooqi
+|author=Ghulam Murtaza |author2=Azhar Ali Khan |author3=Syed Wasi Alam |author4=Aqeel Farooqi
 | date=2011-04-09
-| accessdate=2018-09-13}}</ref> It is equivalent to a chain of 4 subciphers with independent keys, such that if 3 of the keys are known, the remaining cipher should still be secure.
+| access-date=2018-09-13}}</ref> It is equivalent to a chain of 4 subciphers with independent keys, such that if 3 of the keys are known, the remaining cipher should still be secure.
 ==References==