A differential cryptanalysis of Yen Chen Wu multimedia cryptography system

Li, Chengqing; Li, Shujun; Lo, Kwok-Tung; Kyamakya, Kyandoghere

A differential cryptanalysis of Yen Chen Wu multimedia cryptography system

Dateien

JSS2010_2.pdfGröße: 952.21 KBDownloads: 415

Datum

2010

Autor:innen

Li, Chengqing

Li, Shujun

Lo, Kwok-Tung

Kyamakya, Kyandoghere

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft
Zukunftskolleg

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Journal of Systems and Software. 2010, 83(8), pp. 1443-1452. Available under: doi: 10.1016/j.jss.2010.02.039

Zusammenfassung

Recently, Yen et al. presented a new chaos-based cryptosystem for multimedia transmission named multimedia cryptography system (MCS). No cryptanalytic results have been reported so far. This paper presents a differential attack to break MCS, which requires only seven chosen plaintexts. The complexity of the attack is O(N), where N is the size of plaintext. Experimental results are also given to show the real performance of the proposed attack.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Chaos, Cryptanalysis, Differential attack, Encryption, Multimedia, Security

Zitieren

ISO 690

LI, Chengqing, Shujun LI, Kwok-Tung LO, Kyandoghere KYAMAKYA, 2010. A differential cryptanalysis of Yen Chen Wu multimedia cryptography system. In: Journal of Systems and Software. 2010, 83(8), pp. 1443-1452. Available under: doi: 10.1016/j.jss.2010.02.039

BibTex

@article{Li2010diffe-5965,
  year={2010},
  doi={10.1016/j.jss.2010.02.039},
  title={A differential cryptanalysis of Yen Chen Wu multimedia cryptography system},
  number={8},
  volume={83},
  journal={Journal of Systems and Software},
  pages={1443--1452},
  author={Li, Chengqing and Li, Shujun and Lo, Kwok-Tung and Kyamakya, Kyandoghere}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5965">
    <dc:creator>Kyamakya, Kyandoghere</dc:creator>
    <dc:format>application/pdf</dc:format>
    <dc:creator>Lo, Kwok-Tung</dc:creator>
    <dc:contributor>Li, Shujun</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5965"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Lo, Kwok-Tung</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:creator>Li, Shujun</dc:creator>
    <dcterms:title>A differential cryptanalysis of Yen Chen Wu multimedia cryptography system</dcterms:title>
    <dc:language>eng</dc:language>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5965/1/JSS2010_2.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:26Z</dcterms:available>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5965/1/JSS2010_2.pdf"/>
    <dc:creator>Li, Chengqing</dc:creator>
    <dcterms:bibliographicCitation>Publ. in: Journal of Systems and Software 83 (2010), 8, pp. 1443-1452</dcterms:bibliographicCitation>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2010</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:abstract xml:lang="eng">Recently, Yen et al. presented a new chaos-based cryptosystem for multimedia transmission named  multimedia cryptography system  (MCS). No cryptanalytic results have been reported so far. This paper presents a differential attack to break MCS, which requires only seven chosen plaintexts. The complexity of the attack is O(N), where N is the size of plaintext. Experimental results are also given to show the real performance of the proposed attack.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:26Z</dc:date>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Kyamakya, Kyandoghere</dc:contributor>
    <dc:contributor>Li, Chengqing</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja