The generalized shrinking-multiplexing generator
Todor Tashev, Borislav Yordanov Bedzhev, Zhaneta Tasheva · 2007
A new construction of a cryptographic generator which produces a p-ary pseudo random sequence (PRS) is proposed in this paper. The special features of architecture, called Generalized Shrinking-Multiplexing Generator (GSMG), are analyzed. The new method transforming an output p-ary GSMG sequence into binary is investigated. Finally, it is proofed that the output GSMG binary sequence is balanced and it does not contain any subsequence of 2[log2(p-1)] consecutive 1s or 0s. The established GSMG properties show that the PRSs generated by GSMG are suitable for high-speed cryptographic applications in the stream ciphers.