Igor Shparlinski
Igor Shparlinski
Dirección de correo verificada de unsw.edu.au - Página principal
Citado por
Citado por
Recurrence sequences
G Everest, AJ Van Der Poorten, I Shparlinski, T Ward
American Mathematical Society, 2003
Character sums with exponential functions and their applications
SV Konyagin, IE Shparlinski
Cambridge University Press, 1999
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.
PQ Nguyen, IE Shparlinski
Journal of Cryptology 15 (3), 2002
The insecurity of the elliptic curve digital signature algorithm with partially known nonces
PQ Nguyen, IE Shparlinski
Designs, codes and cryptography 30 (2), 201-217, 2003
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ...
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006
Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
I Shparlinski
Springer Science & Business Media, 2013
Computational and algorithmic problems in finite fields
IE Shparlinski
Springer Science & Business Media, 1992
Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness
I Shparlinski
Birkhäuser, 2013
On the statistical properties of Diffie-Hellman distributions
R Canetti, J Friedlander, S Konyagin, M Larsen, D Lieman, I Shparlinski
Israel Journal of Mathematics 120 (1), 23-46, 2000
Period of the power generator and small values of Carmichael’s function
J Friedlander, C Pomerance, I Shparlinski
Mathematics of computation 70 (236), 1591-1605, 2001
Parameters of integral circulant graphs and periodic quantum dynamics
N Saxena, S Severini, IE Shparlinski
International Journal of Quantum Information 5 (03), 417-430, 2007
On exponential sums and group generators for elliptic curves over finite fields
DR Kohel, IE Shparlinski
International Algorithmic Number Theory Symposium, 395-404, 2000
Distribution of modular sums and the security of the server aided exponentiation
PQ Nguyen, IE Shparlinski, J Stern
Cryptography and Computational Number Theory, 331-342, 2001
On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping
D Coppersmith, I Shparlinski
Journal of Cryptology 13 (3), 339-360, 2000
Finite Fields and Applications: Eighth International Conference on Finite Fields and Applications, July 9-13, 2007, Melbourne, Australia
GL Mullen, D Panario, IE Shparlinski
American Mathematical Soc., 2008
Graphs with integral spectrum
O Ahmadi, N Alon, IF Blake, IE Shparlinski
Linear Algebra and its Applications 430 (1), 547-552, 2009
Recent advances in the theory of nonlinear pseudorandom number generators
H Niederreiter, IE Shparlinski
Monte Carlo and Quasi-Monte Carlo Methods 2000, 86-102, 2002
Pseudorandomness and dynamics of Fermat quotients
A Ostafe, IE Shparlinski
SIAM Journal on Discrete Mathematics 25 (1), 50-71, 2011
On the energy of some circulant graphs
I Shparlinski
Linear algebra and its applications 414 (1), 378-382, 2006
Number theoretic methods in cryptography: Complexity lower bounds
I Shparlinski
Birkhäuser, 2012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20