Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 31.

Add to Quick Collection   All 31 Results

Sort:
 Add All Items to Quick Collection
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/144970
Description: Boolean functions and their Möbius transforms are involved in logical calculation, digital communications, coding theory and modern cryptography. So far, little is known about the relations of Boolean ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1170238
Description: 16 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/42902
Description: We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41607
Description: We show that the communication complexity of the parity of the sum of binary digits of x+y is at least 0.085667...n+O(1) where x and y are n-bit integers. We also obtain a nontrivial (but weaker) lowe ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/48143
Description: For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through all of roots modulo p of all monic univariate polynomials of degree d whose vector of coefficients bel ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/25302
Description: We estimate exponential sums of the form [equation omitted for formatting reasons] where f is a polynomial with integer cofficients, and ind n is the discrete logarithm of n modulo an odd prime p and ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/81785
Description: We use character sums to confirm several recent conjectures of V. I. Arnold on the uniformity of distribution properties of a certain dynamical system in a finite field. On the other hand, we show tha ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/8814
Description: 19 page(s)
Date: 2006
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/10823
Description: 36 page(s)
Date: 2006
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/7623
Description: 33 page(s)
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/43466
Description: Given an integer n, how hard is it to find the set of all integers m such that φ(m) = n, where φ is the Euler totient function? We present a certain basic algorithm which, given the prime number facto ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/20158
Description: We estimate certain double character sums over points of an elliptic curve and in the multiplicative subgroup of a finite field. These bounds both improve and extend the scope of a series of previous ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100712
Description: 16 page(s)
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/7768
Description: 24 page(s)
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100720
Description: 14 page(s)
Reviewed: Reviewed