Ontology type: schema:Chapter
2014
AUTHORSYonglin Hao , Dongxia Bai , Leibo Li
ABSTRACTThis paper describes a meet-in-the-middle (MITM) attack against the round reduced versions of the block cipher mCrypton-64/96/ 128. We construct a 4-round distinguisher and lower the memory requirement from 2100 to 244 using the differential enumeration technique. Based on the distinguisher, we launch a MITM attack on 7-round mCrypton-64/96/128 with complexities of 244 64-bit blocks and 257 encryptions. Then we extend the basic attack to 8 rounds for mCrypton-128 by adding some key-bridging techniques. The 8-round attack on mCrypton-128 requires a time complexity 2100 and a memory complexity 244. Furthermore, we construct a 5-round distinguisher and propose a MITM attack on 9-round mCrypton-128 with a time complexity of 2115 encryptions and a memory complexity of 2113 64-bit blocks. More... »
PAGES166-183
Network and System Security
ISBN
978-3-319-11697-6
978-3-319-11698-3
http://scigraph.springernature.com/pub.10.1007/978-3-319-11698-3_13
DOIhttp://dx.doi.org/10.1007/978-3-319-11698-3_13
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1006041236
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/17",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Psychology and Cognitive Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1701",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Psychology",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Computer Science and Technology, Tsinghua Universtiy, 100084, Beijing, China",
"id": "http://www.grid.ac/institutes/grid.12527.33",
"name": [
"Department of Computer Science and Technology, Tsinghua Universtiy, 100084, Beijing, China"
],
"type": "Organization"
},
"familyName": "Hao",
"givenName": "Yonglin",
"id": "sg:person.014270173173.47",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014270173173.47"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science and Technology, Tsinghua Universtiy, 100084, Beijing, China",
"id": "http://www.grid.ac/institutes/grid.12527.33",
"name": [
"Department of Computer Science and Technology, Tsinghua Universtiy, 100084, Beijing, China"
],
"type": "Organization"
},
"familyName": "Bai",
"givenName": "Dongxia",
"id": "sg:person.013743431562.21",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013743431562.21"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, School of Mathematics, Shandong University, 250100, Jinan, China",
"id": "http://www.grid.ac/institutes/grid.27255.37",
"name": [
"Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, School of Mathematics, Shandong University, 250100, Jinan, China"
],
"type": "Organization"
},
"familyName": "Li",
"givenName": "Leibo",
"id": "sg:person.015342573031.14",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015342573031.14"
],
"type": "Person"
}
],
"datePublished": "2014",
"datePublishedReg": "2014-01-01",
"description": "This paper describes a meet-in-the-middle (MITM) attack against the round reduced versions of the block cipher mCrypton-64/96/ 128. We construct a 4-round distinguisher and lower the memory requirement from 2100 to 244 using the differential enumeration technique. Based on the distinguisher, we launch a MITM attack on 7-round mCrypton-64/96/128 with complexities of 244 64-bit blocks and 257 encryptions. Then we extend the basic attack to 8 rounds for mCrypton-128 by adding some key-bridging techniques. The 8-round attack on mCrypton-128 requires a time complexity 2100 and a memory complexity 244. Furthermore, we construct a 5-round distinguisher and propose a MITM attack on 9-round mCrypton-128 with a time complexity of 2115 encryptions and a memory complexity of 2113 64-bit blocks.",
"editor": [
{
"familyName": "Au",
"givenName": "Man Ho",
"type": "Person"
},
{
"familyName": "Carminati",
"givenName": "Barbara",
"type": "Person"
},
{
"familyName": "Kuo",
"givenName": "C.-C. Jay",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-11698-3_13",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-11697-6",
"978-3-319-11698-3"
],
"name": "Network and System Security",
"type": "Book"
},
"keywords": [
"rounds",
"attacks",
"technique",
"block",
"middle attack",
"MITM attacks",
"meet",
"version",
"memory requirements",
"requirements",
"enumeration technique",
"complexity",
"encryption",
"basic attacks",
"time complexity",
"memory complexity",
"distinguisher",
"mCrypton",
"paper"
],
"name": "A Meet-in-the-Middle Attack on Round-Reduced mCrypton Using the Differential Enumeration Technique",
"pagination": "166-183",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1006041236"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-11698-3_13"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-11698-3_13",
"https://app.dimensions.ai/details/publication/pub.1006041236"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-08-04T17:20",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_398.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-319-11698-3_13"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-11698-3_13'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-11698-3_13'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-11698-3_13'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-11698-3_13'
This table displays all metadata directly associated to this object as RDF triples.
105 TRIPLES
22 PREDICATES
44 URIs
37 LITERALS
7 BLANK NODES