Abstract
Let V be a finitely generated multiplicative semi-group with r generators in the ring of integers \(\mathbb{Z}_\mathbb{K}\)of an algebraic number field \(\mathbb{K}\)of degree n over ℚ. We use various bounds for character sums to obtain results on the distribution of the residues of elements of V modulo an integer ideal q. In the simplest case, when \(\mathbb{K} = \mathbb{Q}\)and r = 1 this is a classical question on the distribution of residues of an exponential function, which may be interpreted as concerning the quality of the linear congruential pseudo-random number generator. Besides this well known application we consider several other problems from algebraic number theory, the theory of function fields over a finite field, complexity theory, cryptography, and coding theory where results on the distribution of some group V modulo q play a central role.
Preview
Unable to display preview. Download preview PDF.
References
E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, NY, 1968.
L. Blum, M. Blum and M. Shub, ‘A Simple Unpredictable Pseudo-Random Number Generator', SIAM J. Comp., 15 (1986), p. 364–383.
L. P. Bocharova, V. S. Van'kova and N. M. Dobrovolski, ‘On the Computation of Optimal Coefficients', Matem. Zametki, 49 (1991), 23–28 (in Russian).
H. Davenport, ‘Linear Forms Associated with an Algebraic Number Field', Quart Journ. Math., 3 (1952), 32–41.
S. Egami, ‘The Distribution of Residue Classes Modulo a in an Algebraic Number Field', Tsucuba J. of Math., 4 (1980), 9–13.
A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias and A. Shamir, ‘Reconstructing Truncated Integer Variables Satisfying Linear Congruence', SIAM J. Comp., 17 (1988), 262–280.
A. Garcia and J. F. Voloch, ‘Fermat Curves Over Finite Fields', J. Number Theory, 30 (1988), 345–356.
K. Győry, ‘On Arithmetic graphs Associated with Integral Domains', A Tribute To Paul Erdős, Cambrige Univ. Press, 1990, 207–222.
K. Győry, ‘Some Recent Applications of ‘S-unit Equations', Asterisque, 209 (1992), 17–38.
H.J. Karloff and P. Raghavan, ‘Randomized Algorithms and Pseudorandom Numbers', J. ACM, 40(1993), 454–476.
D. E. Knuth, The Art of Computer Programming, vol.2, Addison-Wesley, Massachusetts, 1981.
N. M. Korobov, Number-Theoretic Methods in Approximate Analysis, Moscow, 1963.
N. M. Korobov, ‘On the Distribution of Signs in Periodic Fractions', Matem. Sbornik, 89 (1972), 654–670 (in Russian).
N. M. Korobov, Exponential Sums and Their Applications, Kluwer Acad. Publ., North-Holland, 1992.
G. Larcher and H. Niederreiter, ‘Optimal Coefficients Modulo Prime Powers in the Three-Dimensional Case', Annali di Mathematica pura ed applicata, 155 (1989), 299–315.
H. W. Lenstra Jr., ‘Euclidean Number Fields of Large Degree', Invent. Math., 38 (1977), 237–254.
R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, 1983.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publ. Comp., 1977.
H. L. Montgomery, ‘Distribution of Small Powers of a Primitive Root', Advances in Number Theory, Clarendon Press, Oxford, 1993, 137–149
W. Narkiewicz, Elementary and Analytic Theory of Algebraic Numbers, Polish Sci. Publ., Warszawa, 1990.
H. Niederreiter, ‘Quasi-Monte Carlo Methods and Pseudo-Random Numbers', Bull. Amer. Math. Soc., 84 (1978), 957–1041.
H. Niederreiter, ‘On a Problem of Kodama Concerning the Hasse-Witt Matrix and Distribution of Residues', Proc. Japan Acad., Ser.A, 63 (1987), 367–369.
H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM Press, 1992.
G. Niklash and R. Queme, ‘An Improvement of Lenstra's Criterion for Euclidean Number Fields: The Totally Real Case', Acta Arithm., 58 (1991), 157–168.
F. Pappalardi, Ph.D. Thesis, McGill Univ., 1993.
I. E. Shparlinski, ‘Bounds for exponential sums with recurring sequences and their applications', Proc. Voronezh State Pedagogical Inst., 197 (1978), 74–85 (in Russian).
I. E. Shparlinski, ‘On Residue Classes Modulo a Prime Number in an Algebraic Number Field', Matem. Zametki, 43 (1988), 433–437 (in Russian).
I. E. Shparlinski, ‘On the Dimension of BCH Codes', Problemy Peredachi Inform., 25(1) (1988), 100–103 (in Russian).
I. E. Shparlinski, 'On Gaussian Sums for Finite Fields and Elliptic Curves', Proc. 1-st French-Soviet Workshop on Algebraic Coding., Paris, 1991, Lect. Notes in Computer Sci., 537 (1992), 5–15.
I. E. Shparlinski, Computational Problems in Finite Fields, Kluwer Acad. Publ., North-Holland, 1992.
M. Tompa, ‘Lecture Notes on Probabilistic Algorithms and Pseudorandom Generators', Technical Report 91-07-05, Dept. of Comp. Sci. and Engin., Univ. of Washington, Seatle, 1991.
T. Washio and T. Kodama, ‘Hasse-Witt Matrices of Hyperelliptic Function Fields', Sci. Bull. Fac. Education Nagasaki Univ., 37 (1986), 9–15.
T. Washio and T. Kodama, ‘A Note on a Supersingular Function Fields', Sci. Bull. Fac. Education Nagasaki Univ., 37 (1986), 9–15.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shparlinski, I.E. (1994). On some applications of finitely generated semi-groups. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_66
Download citation
DOI: https://doi.org/10.1007/3-540-58691-1_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58691-3
Online ISBN: 978-3-540-49044-9
eBook Packages: Springer Book Archive