Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness/

Shparlinski, Igor E.

Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness/ Igor Shparlinski. - Basel; Boston: Birkhäuser Verlag, c2003. - viii, 411 p.; 24 cm. - Progress in computer science and applied logic; v. 22 .

Includes bibliographical references (p. [367]-407) and index.

3764366540 (acid-free paper) 0817666540 (acid-free paper)

2002038444


Computational complexity.
Coding theory.
Combinatorial number theory.

512.73 / S559c
© 2023 IMPA Library | Customized & Maintained by Sérgio Pilotto


Powered by Koha