WSEAS Transactions on Computers
Print ISSN: 1109-2750, E-ISSN: 2224-2872
Volume 17, 2018
A Study on Linear Complexity of p-ary Pseudo Random Sequences Generated by pGSSG
Authors: , ,
Abstract: Nowadays, when fast-growing areas, such as IoT, automotive systems, sensor networks, healthcare, distributed control systems, cyber-physical systems, and the smart grid, are widely used there is a need of specific device design with a better balance between security, performance, and resource requirements for resource-constrained environments. Because low linear complexity is undesirable for cryptographic applications, there is a necessity for lightweight cryptographic stream ciphers development with high linear complexity. Due to this reason a linear complexity of p-ary Generalized Self-Shrinking Generator (pGSSG), which has very simple design and is suitable for lightweight stream cipher, is investigated in this paper. Mathematically was shown that the extended Euclidean algorithm can be applied to find the linear complexity of p-ary pseudorandom sequences. The conducted tests show that the pGSSG linear complexity is close to its theoretical upper bound.
Search Articles
Keywords: Linear complexity, pseudo random sequences, pGSSG, extended Euclidean algorithm, pLFSR, lightweight cryptography
Pages: 197-201
WSEAS Transactions on Computers, ISSN / E-ISSN: 1109-2750 / 2224-2872, Volume 17, 2018, Art. #24