Abstract
We survey our constructions of pseudo random sequences (binary, ℤ8, ℤ2l,... ) from Galois rings. Techniques include a local Weil bound for character sums, and several kinds of Fourier transform. Applications range from cryptography (boolean functions, key generation), to communications (multi-code CDMA), to signal processing (PAPR reduction). © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Solé, P., & Zinoviev, D. (2007). Galois rings and pseudo-random sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4887 LNCS, pp. 16–33). Springer Verlag. https://doi.org/10.1007/978-3-540-77272-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
