Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 10 of 10.

Add to Quick Collection   All 10 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/1055140
Description: Given a function f in a finite field Fq of q elements, we define the functional graph of f as a directed graph on q nodes labelled by the elements of Fq where there is an edge from u to v if and only ... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1193207
Description: We use character sums to derive new bounds on the additive energy of the set of distances (counted with multiplicities) between two subsets of a vector space over a given finite field. We also give ap ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/276237
Description: The authors have recently introduced and studied a modification of the classical number theoretic question about the largest gap between consecutive quadratic non-residues and primitive roots modulo a ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/272086
Description: We show that the reductions modulo primes p ≤ x of the elliptic curve Ea,b : Y² = X³ + aX + b behave as predicted by the Sato-Tate conjecture, on average over integers a and b such that a ∈ A and b ∈ ... 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: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/202843
Description: We consider the problem of recovering a hidden element s of a finite field Fq of q elements from queries to an oracle that for a given x ∈ Fq returns (x+s)e for a given divisor e | q - 1. We use some ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/174485
Description: 6 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/320300
Description: 10 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/320367
Description: 6 page(s)
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1142098
Description: Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds of character sums, we estimate the average value of the character sums with subsequence sums Tm (S,χ) ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last