The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Uma transformação tudo ou nada (AONT), proposta por Rivest, é um dos modos de criptografia. O AONT tem como objetivo aumentar o custo dos ataques brutos em uma cifra de bloco. Este artigo fornece a definição revisada de um AONT incondicionalmente seguro e mostra a instância de um AONT incondicionalmente seguro ideal. Além disso, propomos um AONT computacionalmente seguro tal que qualquer informação sobre uma mensagem não possa ser obtida independentemente da posição do bloco perdido devido a um código linear.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hidenori KUWAKADO, Hatsukazu TANAKA, "All-or-Nothing Transform Based on a Linear Code" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 1084-1087, May 2002, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_1084/_p
Copiar
@ARTICLE{e85-a_5_1084,
author={Hidenori KUWAKADO, Hatsukazu TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={All-or-Nothing Transform Based on a Linear Code},
year={2002},
volume={E85-A},
number={5},
pages={1084-1087},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copiar
TY - JOUR
TI - All-or-Nothing Transform Based on a Linear Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1084
EP - 1087
AU - Hidenori KUWAKADO
AU - Hatsukazu TANAKA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - 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.
ER -