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
Exploramos maneiras de otimizar esquemas de criptografia autenticada (AE) on-line baseados em permutação para aplicativos leves. As aplicações leves exigem que os esquemas de EA operem em ambientes com recursos limitados, o que levanta duas questões: 1) os custos de implementação devem ser baixos e 2) garantir o uso adequado de um nonce é difícil devido ao seu pequeno tamanho e à falta de aleatoriedade. No que diz respeito aos custos de implementação, recentemente foi reconhecido que esquemas baseados em permutação (em vez de esquemas baseados em cifras de bloco) frequentemente apresentam vantagens. No entanto, em relação à segurança sob uso indevido, a construção duplex baseada em permutação padrão não pode garantir a confidencialidade. Existe um esquema baseado em permutação denominado APE que oferece certa robustez contra o uso indevido de nonce. Infelizmente, a construção APE tem várias desvantagens, como expansão de texto cifrado e circuitos de permutação bidirecionais. A expansão do texto cifrado exigiria mais largura de banda e os circuitos bidirecionais exigiriam um espaço de hardware maior. Neste artigo, propomos novas construções de EA baseadas em permutação online que requerem menos largura de banda, menor consumo de hardware e menores custos computacionais. Fornecemos provas de segurança para as novas construções, demonstrando que são tão seguras quanto a construção do APE.
Yu SASAKI
NTT Secure Platform Laboratories
Kan YASUDA
NTT Secure Platform Laboratories
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
Yu SASAKI, Kan YASUDA, "Optimizing Online Permutation-Based AE Schemes for Lightweight Applications" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 1, pp. 35-47, January 2019, doi: 10.1587/transfun.E102.A.35.
Abstract: We explore ways to optimize online, permutation-based authenticated encryption (AE) schemes for lightweight applications. The lightweight applications demand that AE schemes operate in resource-constrained environments, which raise two issues: 1) implementation costs must be low, and 2) ensuring proper use of a nonce is difficult due to its small size and lack of randomness. Regarding the implementation costs, recently it has been recognized that permutation-based (rather than block-cipher-based) schemes frequently show advantages. However, regarding the security under nonce misuse, the standard permutation-based duplex construction cannot ensure confidentiality. There exists one permutation-based scheme named APE which offers certain robustness against nonce misuse. Unfortunately, the APE construction has several drawbacks such as ciphertext expansion and bidirectional permutation circuits. The ciphertext expansion would require more bandwidth, and the bidirectional circuits would require a larger hardware footprint. In this paper, we propose new constructions of online permutation-based AE that require less bandwidth, a smaller hardware footprint and lower computational costs. We provide security proofs for the new constructions, demonstrating that they are as secure as the APE construction.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.35/_p
Copiar
@ARTICLE{e102-a_1_35,
author={Yu SASAKI, Kan YASUDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimizing Online Permutation-Based AE Schemes for Lightweight Applications},
year={2019},
volume={E102-A},
number={1},
pages={35-47},
abstract={We explore ways to optimize online, permutation-based authenticated encryption (AE) schemes for lightweight applications. The lightweight applications demand that AE schemes operate in resource-constrained environments, which raise two issues: 1) implementation costs must be low, and 2) ensuring proper use of a nonce is difficult due to its small size and lack of randomness. Regarding the implementation costs, recently it has been recognized that permutation-based (rather than block-cipher-based) schemes frequently show advantages. However, regarding the security under nonce misuse, the standard permutation-based duplex construction cannot ensure confidentiality. There exists one permutation-based scheme named APE which offers certain robustness against nonce misuse. Unfortunately, the APE construction has several drawbacks such as ciphertext expansion and bidirectional permutation circuits. The ciphertext expansion would require more bandwidth, and the bidirectional circuits would require a larger hardware footprint. In this paper, we propose new constructions of online permutation-based AE that require less bandwidth, a smaller hardware footprint and lower computational costs. We provide security proofs for the new constructions, demonstrating that they are as secure as the APE construction.},
keywords={},
doi={10.1587/transfun.E102.A.35},
ISSN={1745-1337},
month={January},}
Copiar
TY - JOUR
TI - Optimizing Online Permutation-Based AE Schemes for Lightweight Applications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 35
EP - 47
AU - Yu SASAKI
AU - Kan YASUDA
PY - 2019
DO - 10.1587/transfun.E102.A.35
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2019
AB - We explore ways to optimize online, permutation-based authenticated encryption (AE) schemes for lightweight applications. The lightweight applications demand that AE schemes operate in resource-constrained environments, which raise two issues: 1) implementation costs must be low, and 2) ensuring proper use of a nonce is difficult due to its small size and lack of randomness. Regarding the implementation costs, recently it has been recognized that permutation-based (rather than block-cipher-based) schemes frequently show advantages. However, regarding the security under nonce misuse, the standard permutation-based duplex construction cannot ensure confidentiality. There exists one permutation-based scheme named APE which offers certain robustness against nonce misuse. Unfortunately, the APE construction has several drawbacks such as ciphertext expansion and bidirectional permutation circuits. The ciphertext expansion would require more bandwidth, and the bidirectional circuits would require a larger hardware footprint. In this paper, we propose new constructions of online permutation-based AE that require less bandwidth, a smaller hardware footprint and lower computational costs. We provide security proofs for the new constructions, demonstrating that they are as secure as the APE construction.
ER -