COCONUT98 (original) (raw)
In crittografia il COCONUT98, acronimo di Cipher Organized with Cute Operations and N-Universal Transformation, è un cifrario a blocchi progettato da nel 1998. È stato uno dei primi algoritmi a cui è stata applicata la teoria della decorrelazione di Vaudenay: è stato sviluppato per essere provatamente sicuro contro la crittanalisi differenziale, la crittanalisi lineare ed anche contro alcuni tipi di attacchi crittografici ancora non scoperti.
| Property | Value |
|---|---|
| dbo:abstract | In cryptography, COCONUT98 (Cipher Organized with Cute Operations and N-Universal Transformation) is a block cipher designed by Serge Vaudenay in 1998. It was one of the first concrete applications of Vaudenay's decorrelation theory, designed to be provably secure against differential cryptanalysis, linear cryptanalysis, and even certain types of undiscovered cryptanalytic attacks. The cipher uses a block size of 64 bits and a key size of 256 bits. Its basic structure is an 8-round Feistel network, but with an additional operation after the first 4 rounds, called a decorrelation module. This consists of a key-dependent affine transformation in the finite field GF(264). The round function makes use of modular multiplication and addition, bit rotation, XORs, and a single 8×24-bit S-box. The entries of the S-box are derived using the binary expansion of e as a source of "nothing up my sleeve numbers". Despite Vaudenay's proof of COCONUT98's security, in 1999 David Wagner developed the boomerang attack against it. This attack, however, requires both chosen plaintexts and adaptive chosen ciphertexts, so is largely theoretical. Then in 2002, Biham, et al. applied differential-linear cryptanalysis, a purely chosen-plaintext attack, to break the cipher. The same team has also developed what they call a related-key boomerang attack, which distinguishes COCONUT98 from random using one related-key adaptive chosen plaintext and ciphertext quartet under two keys. (en) In crittografia il COCONUT98, acronimo di Cipher Organized with Cute Operations and N-Universal Transformation, è un cifrario a blocchi progettato da nel 1998. È stato uno dei primi algoritmi a cui è stata applicata la teoria della decorrelazione di Vaudenay: è stato sviluppato per essere provatamente sicuro contro la crittanalisi differenziale, la crittanalisi lineare ed anche contro alcuni tipi di attacchi crittografici ancora non scoperti. (it) |
| dbo:wikiPageID | 9329898 (xsd:integer) |
| dbo:wikiPageLength | 4990 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1084898834 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Bit_rotation dbr:David_A._Wagner dbr:DFC_(cipher) dbr:Decorrelation_theory dbr:Cryptography dbr:Modular_arithmetic dbr:Chosen-plaintext_attack dbr:Feistel_cipher dbr:Key_size dbr:Adaptive_chosen-ciphertext_attack dbr:Distinguishing_attack dbr:Linear_cryptanalysis dbr:Affine_transformation dbc:Broken_block_ciphers dbr:E_(mathematical_constant) dbr:Finite_field dbr:Differential-linear_attack dbr:Differential_cryptanalysis dbr:Provable_security dbr:Serge_Vaudenay dbr:Block_cipher dbr:Block_size_(cryptography) dbr:Nothing_up_my_sleeve_number dbr:Related-key_attack dbr:Boomerang_attack dbr:XOR dbr:Differential-linear_cryptanalysis dbr:Substitution_box |
| dbp:blockSize | 64 (xsd:integer) |
| dbp:cryptanalysis | The differential-linear attack by Biham, et al. uses 227.7 chosen plaintexts and about 233.7 work, and has a 75.5% success rate. (en) Wagner's boomerang attack uses about 216 adaptively-chosen plaintexts and ciphertexts, about 238 work, and succeeds with probability 99.96%. (en) |
| dbp:designers | dbr:Serge_Vaudenay |
| dbp:keySize | 256 (xsd:integer) |
| dbp:name | COCONUT98 (en) |
| dbp:publishDate | 1998 (xsd:integer) |
| dbp:relatedTo | dbr:DFC_(cipher) |
| dbp:rounds | 8 (xsd:integer) |
| dbp:structure | Decorrelated Feistel cipher (en) |
| dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Short_description dbt:Cryptography_navbox dbt:Infobox_block_cipher |
| dct:subject | dbc:Broken_block_ciphers |
| gold:hypernym | dbr:Cipher |
| rdf:type | yago:WikicatBrokenBlockCiphers dbo:Noble yago:Abstraction100002137 yago:Cipher106254239 yago:Communication100033020 yago:Message106253690 |
| rdfs:comment | In crittografia il COCONUT98, acronimo di Cipher Organized with Cute Operations and N-Universal Transformation, è un cifrario a blocchi progettato da nel 1998. È stato uno dei primi algoritmi a cui è stata applicata la teoria della decorrelazione di Vaudenay: è stato sviluppato per essere provatamente sicuro contro la crittanalisi differenziale, la crittanalisi lineare ed anche contro alcuni tipi di attacchi crittografici ancora non scoperti. (it) In cryptography, COCONUT98 (Cipher Organized with Cute Operations and N-Universal Transformation) is a block cipher designed by Serge Vaudenay in 1998. It was one of the first concrete applications of Vaudenay's decorrelation theory, designed to be provably secure against differential cryptanalysis, linear cryptanalysis, and even certain types of undiscovered cryptanalytic attacks. (en) |
| rdfs:label | COCONUT98 (en) COCONUT98 (it) |
| owl:sameAs | freebase:COCONUT98 yago-res:COCONUT98 wikidata:COCONUT98 dbpedia-it:COCONUT98 https://global.dbpedia.org/id/3NB5m |
| prov:wasDerivedFrom | wikipedia-en:COCONUT98?oldid=1084898834&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:COCONUT98 |
| is dbo:wikiPageDisambiguates of | dbr:Coconut_(disambiguation) |
| is dbo:wikiPageWikiLink of | dbr:Encryption_by_date dbr:DFC_(cipher) dbr:Decorrelation_theory dbr:Index_of_cryptography_articles dbr:Coconut_(disambiguation) dbr:Boomerang_attack |
| is dbp:relatedTo of | dbr:DFC_(cipher) |
| is foaf:primaryTopic of | wikipedia-en:COCONUT98 |