Related-Key Cryptanalysis on the Full PRINTcipher Suitable for IC-Printing

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

International Journal of Distributed Sensor Networks, 2014, vol. 10, issue 1, 389476

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 47 related-key chosen plaintexts with a computational complexity of 2 60 · 62 . In the case of PRINTcipher-96, we require 2 95 related-key chosen plaintexts with a computational complexity of 2 107 . These results are the first known related-key cryptanalytic results on them.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2014/389476 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:10:y:2014:i:1:p:389476

DOI: 10.1155/2014/389476

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().