Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 7 of 7.

Add to Quick Collection   All 7 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/1195126
Description: 20 page(s)
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1201720
Description: We give deterministic polynomial time algorithms for two different decision version the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N. A. Howgrave-Graham in 2001. For ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/202794
Description: We give a survey of a variety of recent results about the distribution and some geometric properties of points (x, y) on modular hyperbolas xy ≡ a (mod m). We also outline a very diverse range of appl ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/173573
Description: We estimate multiplicative character sums over the integers with a fixed sum of binary digits and apply these results to study the distribution of products of such integers in residues modulo a prime ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/82430
Description: 13 page(s)
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/9957
Description: We estimate character sums with Catalan numbers and middle binomial coefficients modulo a prime p. We use this bound to show that the first at most p<sup>13/2</sup>(logp)⁶ elements of each sequence al ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/26755
Description: For positive integers m, U and V, we obtain an asymptotic formula for the number of integer points (u,v) ∈ [1,U]x[1,V] which belong to the modular hyperbola uv ≡ 1 (mod m) and also have gcd(u,v) = 1, ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last