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
Kami meneroka cara untuk mengoptimumkan dalam talian, skim penyulitan disahkan (AE) berasaskan permutasi untuk aplikasi ringan. Aplikasi ringan menuntut skim AE beroperasi dalam persekitaran terhad sumber, yang menimbulkan dua isu: 1) kos pelaksanaan mestilah rendah, dan 2) memastikan penggunaan nonce yang betul adalah sukar kerana saiznya yang kecil dan kekurangan rawak. Berkenaan kos pelaksanaan, baru-baru ini telah diiktiraf bahawa skim berasaskan pilih atur (bukan berasaskan sifir blok) sering menunjukkan kelebihan. Walau bagaimanapun, mengenai keselamatan yang tidak disalahgunakan, pembinaan dupleks berasaskan pilihatur standard tidak dapat memastikan kerahsiaan. Terdapat satu skim berasaskan pilih atur bernama APE yang menawarkan keteguhan tertentu terhadap penyalahgunaan bukan sekali. Malangnya, pembinaan APE mempunyai beberapa kelemahan seperti pengembangan teks sifir dan litar pilih atur dua arah. Pengembangan teks sifir memerlukan lebih lebar jalur, dan litar dua arah memerlukan jejak perkakasan yang lebih besar. Dalam kertas kerja ini, kami mencadangkan pembinaan baharu AE berasaskan pilihatur dalam talian yang memerlukan kurang lebar jalur, jejak perkakasan yang lebih kecil dan kos pengiraan yang lebih rendah. Kami menyediakan bukti keselamatan untuk pembinaan baharu, menunjukkan bahawa ia selamat seperti pembinaan 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.
Salinan
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
Salinan
@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},}
Salinan
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 -