|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
All-or-Nothing Transform Based on a Linear Code
Hidenori KUWAKADO Hatsukazu TANAKA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E85-A
No.5
pp.1084-1087 Publication Date: 2002/05/01 Online ISSN:
DOI: Print ISSN: 0916-8508 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cryptography, information security, all-or-nothing transform, encryption mode, linear code,
Full Text: PDF(134.7KB)>>
Summary:
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.
|
|