Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 76 - 90 of 373.

Add to Quick Collection   All 373 Results

Sort:
 Add All Items to Quick Collection
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1197364
Description: We obtain new results concerning the Lang–Trotter conjectures on Frobenius traces and Frobenius fields over single and double parametric families of elliptic curves. We also obtain similar results wit ... More
Reviewed: Reviewed
Date: 2013
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/278983
Description: 15 page(s)
Reviewed: Reviewed
Date: 2008
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/44482
Description: 10 page(s)
Full Text: Full Text
Reviewed: Reviewed
Date: 2001
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118588
Description: Let g be a primitive root modulo a (n+1)-bit prime p. In this paper we prove the uniformity of distribution of the Diffie--Hellman triples (gx, gy, gxy) as the exponents x and y run through the set of ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2006
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/43365
Description: Let p be a prime and ϑ an integer of order t in the multiplicative group modulo p. In this paper, we continue the study of the distribution of Diffie–Hellman triples (ϑ<sup>x</sup>, ϑ<sup>y</sup>, ϑ<s ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/159886
Description: 9 page(s)
Reviewed: Reviewed
Date: 2010
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/119975
Description: 8 page(s)
Full Text: Full Text
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1197920
Description: 10 page(s)
Reviewed: Reviewed
Date: 2008
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/78540
Description: 29 page(s)
Reviewed: Reviewed
Date: 2004
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118682
Description: Boneh and Venkatesan have recently proposed an approach to proving that a reasonably small portions of most significant bits of the Diffie–Hellman key modulo a prime are as secure as the whole key. So ... More
Reviewed: Reviewed
Date: 2008
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/44703
Description: We use a result of Y. Furuta to show that for almost all positive integers m, the cyclotomic field Q(exp(2πi/m)) has an infinite Hilbert p-class field tower with high rank Galois groups at each step, ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/47007
Description: For a given residue class a ± od m with gcd(a, m) = 1, upper bounds are obtained on the smallest value of n with {varphi}(n) ≡ a ± od m. Here, as usual {varphi}(n) denotes the Euler function. These bo ... More
Reviewed: Reviewed
Date: 2012
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/196165
Description: 9 page(s)
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/119902
Description: 62 page(s)
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