Applied Number Theory
From MaRDI portal
Publication:2945860
DOI10.1007/978-3-319-22321-6zbMath1328.11001OpenAlexW4241467539MaRDI QIDQ2945860
Arne Winterhof, Harald Niederreiter
Publication date: 14 September 2015
Full work available at URL: https://doi.org/10.1007/978-3-319-22321-6
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Miscellaneous applications of number theory (11Z05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (19)
A new lower bound on the family complexity of Legendre sequences ⋮ On the linear complexity profile of some sequences derived from elliptic curves ⋮ Normality of the Thue-Morse function for finite fields along polynomial values ⋮ Pseudorandom sequences derived from automatic sequences ⋮ Свойства распределений элементов в одном классе последовательностей над кольцами Галуа ⋮ A sharp estimate of the discrepancy of a concatenation sequence of inversive pseudorandom numbers with consecutive primes ⋮ Least squares orthogonal polynomial regression estimation for irregular design ⋮ Correlation measure of binary sequence families with trace representation ⋮ Completely uniformly distributed sequences based on de Bruijn sequences ⋮ Character sums over sparse elements of finite fields ⋮ A survey of some applications of finite fields ⋮ Ian Sloan and Lattice Rules ⋮ On the existence of perfect splitter sets ⋮ On derivatives of planar mappings and their connections to complete mappings ⋮ On least squares discrete Fourier analysis of unequally spaced data ⋮ Unnamed Item ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences ⋮ On the index of the Diffie-Hellman mapping ⋮ Bounds on the discrepancy of linear recurring sequences over Galois rings
This page was built for publication: Applied Number Theory
