TY - GEN

T1 - Improvement of Bit Distribution of Binary Sequence Generated by Alternative Trace Map Function

AU - Akhter, Fatema

AU - Tatara, Tomoya

AU - Nogami, Yasuyuki

AU - Kusaka, Takuya

AU - Funabiki, Nobuo

N1 - Publisher Copyright:
© 2020 IEEE.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2020/11

Y1 - 2020/11

N2 - Pseudo random binary sequences have been widely used in cryptographic applications due to their speedy construction, reproducibility and characteristics like true random sequence. Realization of modern cryptographic application and mathematical tools is inconceivable without random sequences. Previously, we proposed an alternative trace map function for generation of a pseudo random binary sequence that has long period, good correlation characteristics and high linear complexity that are attractive for security applications. However, it was found that the distribution of bits in sequence is not uniform which may lead to failure in randomness. In this paper, we propose a uniformization method using power of primitive root to improve uniformity of bit distribution in the sequence. Sequence of different lengths is generated using proposed sequence to verify the efficiency of the proposed uniformization method. By analyzing the bit distribution of generated sequences for different length of patterns, we show that the proposal achieves bit uniformity while maintaining randomness of the sequence.

AB - Pseudo random binary sequences have been widely used in cryptographic applications due to their speedy construction, reproducibility and characteristics like true random sequence. Realization of modern cryptographic application and mathematical tools is inconceivable without random sequences. Previously, we proposed an alternative trace map function for generation of a pseudo random binary sequence that has long period, good correlation characteristics and high linear complexity that are attractive for security applications. However, it was found that the distribution of bits in sequence is not uniform which may lead to failure in randomness. In this paper, we propose a uniformization method using power of primitive root to improve uniformity of bit distribution in the sequence. Sequence of different lengths is generated using proposed sequence to verify the efficiency of the proposed uniformization method. By analyzing the bit distribution of generated sequences for different length of patterns, we show that the proposal achieves bit uniformity while maintaining randomness of the sequence.

KW - mapping function

KW - primitive polynomial

KW - primitive root

KW - Pseudo random sequence

KW - uniform bit distribution

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

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

U2 - 10.1109/CANDARW51189.2020.00066

DO - 10.1109/CANDARW51189.2020.00066

M3 - Conference contribution

AN - SCOPUS:85102199316

T3 - Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020

SP - 302

EP - 306

BT - Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 8th International Symposium on Computing and Networking Workshops, CANDARW 2020

Y2 - 24 November 2020 through 27 November 2020

ER -