All-or-Nothing Transform Based on a Linear Code(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• An all-or-nothing transform (AONT), which has been proposed by Rivest, is one of encryption modes. The AONT is intended to increase the cost of brute-fore attacks on a block cipher. This paper provides the revised definition of an unconditionally secure AONT, and shows the instance of an optimal unconditionally secure AONT. In addition, we propose a computationally secure AONT such that any information on a message cannot be obtained regardless of the position of the lost block due to a linear code.

• 社団法人電子情報通信学会の論文
• 2002-05-01

著者

• Kuwakado Hidenori

  The Authors Are With The Faculty Of Engineering Kohe University

• TANAKA Hatsukazu

  The authors are with the Faculty of Engineering, Kohe University

• Tanaka Hatsukazu

  The Authors Are With The Faculty Of Engineering Kohe University

関連論文

• All-or-Nothing Transform Based on a Linear Code(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク