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

Yuta Kodera, Takuya Kusaka, Takeru Miyazaki, Md Al Amin Khandaker, Yasuyuki Nogami, Satoshi Uehara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages451-455
Number of pages5
ISBN (Electronic)9781538620878
DOIs
Publication statusPublished - Apr 23 2018
Event5th International Symposium on Computing and Networking, CANDAR 2017 - Aomori, Japan
Duration: Nov 19 2017Nov 22 2017

Publication series

NameProceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017
Volume2018-January

Other

Other5th International Symposium on Computing and Networking, CANDAR 2017
CountryJapan
CityAomori
Period11/19/1711/22/17

Keywords

  • IoT device
  • Linearity of trace
  • Matrix representation
  • Optimizing trace calculation
  • Pseudorandom sequence

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence'. Together they form a unique fingerprint.

  • Cite this

    Kodera, Y., Kusaka, T., Miyazaki, T., Khandaker, M. A. A., Nogami, Y., & Uehara, S. (2018). An Efficient Implementation of Trace Calculation over Finite Field for a Pseudorandom Sequence. In Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017 (pp. 451-455). (Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CANDAR.2017.86