Macquarie University, Sydney Macquarie University ResearchOnline
conference paper | Shparlinski, Igor E

Showing items 1 - 15 of 16.

Add to Quick Collection   All 16 Results

Sort:
 Add All Items to Quick Collection
Add  Random walks and bisections in random circulant graphs
Authors: Mans, Bernard | Shparlinski, Igor E
Date: 2012
Subject Keyword: 080200 Computation Theory and Mathematics | Circulant graphs | random graphs | random walks
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/183072
Description: 14 page(s)
Reviewed: Reviewed
Add  Elliptic twin prime conjecture
Authors: Friedlander, John B | Shparlinski, Igor E
Date: 2009
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1228286
Description: 5 page(s)
Reviewed: Reviewed
Add  Approximate polynomial gcd : small gegree and small height perturbations
Authors: von zur Gathen, Joachim | Shparlinski, Igor E
Date: 2008
Subject Keyword: 080200 Computation Theory and Mathematics | Euclidean algorithm | gcd | approximate computation
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148652
Description: We consider the following computational problem: we are given two coprime univariate polynomials f₀ and f₁ over a ring R and want to find whether after a small perturbation we can achieve a large gcd. ... More
Reviewed: Reviewed
Add  Classical and quantum algorithms for exponential congruences
Authors: van Dam, Wim | Shparlinski, Igor E
Date: 2008
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/149776
Description: We discuss classical and quantum algorithms for solvability testing and finding integer solutions x,y of equations of the form af x  + bg y  = c over finite fields Fq. A quantum algorithm with time co ... More
Reviewed: Reviewed
Add  On the distribution of the elliptic curve power generator
Authors: El Mahassni, Edwin | Shparlinski, Igor E
Date: 2008
Subject Keyword: 010100 Pure Mathematics | 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148292
Description: 8 page(s)
Reviewed: Reviewed
Add  Pseudorandom graphs from elliptic curves
Authors: Shparlinski, Igor E
Date: 2008
Subject Keyword: 080200 Computation Theory and Mathematics | Pseudorandom graph | elliptic curve | exponential sum
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148657
Description: Most of the constructions of pseudorandom graphs are based on additive or multiplicative groups of elements of finite fields. As a result the number of vertices of such graphs is limited to values of ... More
Reviewed: Reviewed
Add  Pseudorandom points on elliptic curves over finite fields
Authors: Shparlinski, Igor E
Date: 2008
Subject Keyword: 010100 Pure Mathematics | 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/327690
Description: We give a brief survey of several recently suggested constructions of generating sequences of pseudorandom points on elliptic curves. Such constructions are of interest for both classical and elliptic ... More
Reviewed: Reviewed
Add  Distribution of points on modular hyperbolas
Authors: Shparlinski, Igor E
Date: 2007
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1244672
Description: 35 page(s)
Reviewed: Reviewed
Add  Approximating positive reals by ratios of kernels of consecutive integers
Authors: Luca, Florian | Shparlinski, Igor E
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/124379
Description: 9 page(s)
Add  Constructions of approximately mutually unbiased bases
Authors: Shparlinski, Igor E | Winterhof, Arne
Date: 2006
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/9989
Description: We construct systems of bases of ℂ<sup>n</sup> which are mutually almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on bounds of classical ex ... More
Reviewed: Reviewed
Add  On the discrepancy and linear complexity of some counter-dependent recurrence sequences
Authors: Shparlinski, Igor E | Winterhof, Arne
Date: 2006
Subject Keyword: 080200 Computation Theory and Mathematics | recurrence sequences | discrepancy | uniform distribution | linear complexity | nonlinear pseudorandom numbers | counter-dependent generator
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/101357
Description: We prove a discrepancy bound “on average” over all initial values aα(0)=α of congruential pseudorandom numbers obtained from the sequences aα(n) over a finite field of prime order defined by aα(n)=naα ... More
Reviewed: Reviewed
Add  On Stern's attack against secret truncated linear congruential generators
Authors: Shparlinski, Igor E | Contini, Scott
Date: 2005
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1245100
Description: 9 page(s)
Reviewed: Reviewed
Add  Predicting subset sum pseudorandom generators
Authors: von zur Gathen, Joachim | Shparlinski, Igor E
Date: 2005
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148331
Description: 11 page(s)
Reviewed: Reviewed
Add  Quantum noisy rational function reconstruction
Authors: Hallgren, Sean | Russell, Alexander | Shparlinski, Igor E
Date: 2005
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148916
Description: We consider the problem of determining a rational function f over a finite field Fp of p elements given a noisy black box , which for each t⋳Fp returns several most significant bits of the residue of ... More
Reviewed: Reviewed
Add  On Reducing a System of Equations to a Single Equation
Authors: Frandson, Gudmund S | Shparlinski, Igor E
Date: 2004
Subject Keyword: 080200 Computation Theory and Mathematics
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1229594
Description: For a system of polynomial equations over Qp we present an efficient construction of a single polynomial of quite small degree whose zero set over Qp coincides with, the zero set over Qp of the origin ... More
Reviewed: Reviewed