Related-key cryptanalysis on the full PRINTcipher suitable for IC-printing

Yuseop Lee; Kitae Jeong; Changhoon Lee; Jaechul Sung; Seokhie Hong

doi:10.1155/2014/389476

Related-key cryptanalysis on the full PRINTcipher suitable for IC-printing

Yuseop Lee, Kitae Jeong, Changhoon Lee, Jaechul Sung, Seokhie Hong

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

PRINTcipher-48/96 are 48/96-bit block ciphers proposed in CHES 2010 which support the 80/160-bit secret keys, respectively. In this paper, we propose related-key cryptanalysis of PRINTcipher. To recover the 80-bit secret key of PRINTcipher-48, our attack requires 2⁴⁷ related-key chosen plaintexts with a computational complexity of 2 60 · 62. In the case of PRINTcipher-96, we require 2⁹⁵ related-key chosen plaintexts with a computational complexity of 2¹⁰⁷. These results are the first known related-key cryptanalytic results on them.

Original language	English
Article number	389476
Journal	International Journal of Distributed Sensor Networks
Volume	2014
DOIs	https://doi.org/10.1155/2014/389476
State	Published - 2014

Access to Document

10.1155/2014/389476

Cite this

@article{9d65637f76a64f8496de1fcea06efb7f,

title = "Related-key cryptanalysis on the full PRINTcipher suitable for IC-printing",

abstract = "PRINTcipher-48/96 are 48/96-bit block ciphers proposed in CHES 2010 which support the 80/160-bit secret keys, respectively. In this paper, we propose related-key cryptanalysis of PRINTcipher. To recover the 80-bit secret key of PRINTcipher-48, our attack requires 247 related-key chosen plaintexts with a computational complexity of 2 60 · 62. In the case of PRINTcipher-96, we require 295 related-key chosen plaintexts with a computational complexity of 2107. These results are the first known related-key cryptanalytic results on them.",

author = "Yuseop Lee and Kitae Jeong and Changhoon Lee and Jaechul Sung and Seokhie Hong",

year = "2014",

doi = "10.1155/2014/389476",

language = "English",

volume = "2014",

journal = "International Journal of Distributed Sensor Networks",

issn = "1550-1329",

publisher = "Sage-Hindawi",

}

TY - JOUR

T1 - Related-key cryptanalysis on the full PRINTcipher suitable for IC-printing

AU - Lee, Yuseop

AU - Jeong, Kitae

AU - Lee, Changhoon

AU - Sung, Jaechul

AU - Hong, Seokhie

PY - 2014

Y1 - 2014

N2 - PRINTcipher-48/96 are 48/96-bit block ciphers proposed in CHES 2010 which support the 80/160-bit secret keys, respectively. In this paper, we propose related-key cryptanalysis of PRINTcipher. To recover the 80-bit secret key of PRINTcipher-48, our attack requires 247 related-key chosen plaintexts with a computational complexity of 2 60 · 62. In the case of PRINTcipher-96, we require 295 related-key chosen plaintexts with a computational complexity of 2107. These results are the first known related-key cryptanalytic results on them.

AB - PRINTcipher-48/96 are 48/96-bit block ciphers proposed in CHES 2010 which support the 80/160-bit secret keys, respectively. In this paper, we propose related-key cryptanalysis of PRINTcipher. To recover the 80-bit secret key of PRINTcipher-48, our attack requires 247 related-key chosen plaintexts with a computational complexity of 2 60 · 62. In the case of PRINTcipher-96, we require 295 related-key chosen plaintexts with a computational complexity of 2107. These results are the first known related-key cryptanalytic results on them.

UR - http://www.scopus.com/inward/record.url?scp=84893864456&partnerID=8YFLogxK

U2 - 10.1155/2014/389476

DO - 10.1155/2014/389476

M3 - Article

AN - SCOPUS:84893864456

SN - 1550-1329

VL - 2014

JO - International Journal of Distributed Sensor Networks

JF - International Journal of Distributed Sensor Networks

M1 - 389476

ER -

Related-key cryptanalysis on the full PRINTcipher suitable for IC-printing

Abstract

Access to Document

Other files and links

Fingerprint

Cite this