Cargando…
Computational and algorithmic problems in finite fields
Autor principal: | Shparlinski, Igor E |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
1992
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-94-011-1806-4 http://cds.cern.ch/record/1619856 |
Ejemplares similares
-
Finite fields theory and computation: the meeting point of number theory, computer science, coding theory and cryptography
por: Shparlinski, Igor E
Publicado: (1999) -
Cryptography and computational number theory
por: Lam, Kwok-Yan, et al.
Publicado: (2001) -
Finite elements in electrical and magnetic field problems
por: Silvester, Peter Peet, et al.
Publicado: (1980) -
Number theoretic methods in cryptography: complexity lower bounds
por: Shparlinski, Igor
Publicado: (1999) -
Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness
por: Shparlinski, Igor
Publicado: (2003)