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[Formula: see text]. 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.
No takes yet. Share an insight, caveat, or question.
Lee et al. (2014) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: