Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 12 of 12.

Add to Quick Collection   All 12 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1190551
Description: In this paper we study the mapping properties of the averaging operator over a variety given by a system of homogeneous equations over a finite field. We obtain optimal results on the averaging proble ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/305780
Description: Circulant graphs are regular graphs based on Cayley graphs defined on the Abelian group Zn. They are popular network topologies that arise in distributed computing. Using number theoretical tools, we ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/278997
Description: We obtain analogues of several recent bounds on the number of solutions of polynomial congruences modulo a prime with variables in short intervals in the case of polynomial equations in high degree ex ... More
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: reference entry
Identifier: http://hdl.handle.net/1959.14/159913
Description: 5 page(s)
Date: 2008
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/319777
Description: 9 page(s)
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146784
Description: We consider a polynomial analogue of the hidden number problem introduced by Boneh and Venkatesan, namely the sparse polynomial noisy interpolation problem of recovering an unknown polynomial f(X) ∈ M ... More
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1154689
Description: We show that, under some natural conditions, the pairs (r, s) produced by the ElGamal signature scheme are uniformly distributed. In particular this implies that values of r and s are not correlated. ... More
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1154665
Description: We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few consecutive bits of the random nonces k (used at each signature generation) are known for a number ... More
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1146343
Description: 22 page(s)
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1146324
Description: 14 page(s)
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1146295
Description: 6 page(s)
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1125950
Description: 8 page(s)
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last