TY - GEN

T1 - An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence

AU - Kodera, Yuta

AU - Kusaka, Takuya

AU - Miyazaki, Takeru

AU - Khandaker, Md Al Amin

AU - Nogami, Yasuyuki

AU - Uehara, Satoshi

N1 - Publisher Copyright:
© 2017 IEEE.

PY - 2018/4/23

Y1 - 2018/4/23

N2 - Trace function is a well known index of finite field theory and practically, it is used for some security applications. However, present trace calculation with binary method is far from the practice on an IoT device. This paper considers an efficient trace calculation without vector multiplication by focusing on the matrix representation and the linearity of trace function. By using pre-computation, a trace calculation is executed by m times multiplication and the memory consumption is 4m bytes. This paper especially uses a pseudorandom generator called NTU sequence to show the efficiency because it has paid much attention as a random generator for security applications. When considering 128-bit length of periodic sequence with NTU sequence for security applications, parameters will be p = 7 and m = 50. From the experimental results, a trace calculation with them will be executed within 5[μs], and the memory consumption is 200 bytes which is 0:625% of the storage in Arduino Uno. Therefore, this work contributes to implementing an efficient trace calculation on an IoT device with low memory consumption.

AB - Trace function is a well known index of finite field theory and practically, it is used for some security applications. However, present trace calculation with binary method is far from the practice on an IoT device. This paper considers an efficient trace calculation without vector multiplication by focusing on the matrix representation and the linearity of trace function. By using pre-computation, a trace calculation is executed by m times multiplication and the memory consumption is 4m bytes. This paper especially uses a pseudorandom generator called NTU sequence to show the efficiency because it has paid much attention as a random generator for security applications. When considering 128-bit length of periodic sequence with NTU sequence for security applications, parameters will be p = 7 and m = 50. From the experimental results, a trace calculation with them will be executed within 5[μs], and the memory consumption is 200 bytes which is 0:625% of the storage in Arduino Uno. Therefore, this work contributes to implementing an efficient trace calculation on an IoT device with low memory consumption.

KW - IoT device

KW - Linearity of trace

KW - Matrix representation

KW - Optimizing trace calculation

KW - Pseudorandom sequence

UR - http://www.scopus.com/inward/record.url?scp=85050283444&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050283444&partnerID=8YFLogxK

U2 - 10.1109/CANDAR.2017.86

DO - 10.1109/CANDAR.2017.86

M3 - Conference contribution

AN - SCOPUS:85050283444

T3 - Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017

SP - 451

EP - 455

BT - Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 5th International Symposium on Computing and Networking, CANDAR 2017

Y2 - 19 November 2017 through 22 November 2017

ER -