Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 11 of 11.

Add to Quick Collection   All 11 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1194586
Description: We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithm ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/119092
Description: Let E be an ordinary elliptic curve over a finite field Fq of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative c ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130433
Description: For some natural families of elliptic curves we show that "on average" the exponent of the point group of their reductions modulo a prime p grows as p¹⁺⁰⁽¹⁾.
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/346455
Description: This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formulas for binary elliptic curves, ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41852
Description: We estimate character sums over points on elliptic curves over a finite field Fq of q elements. Pseudorandom sequences can be constructed by taking linear combinations with small coefficients (for exa ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/25132
Description: Here, we improve our previous bound on the number of finite fields over which elliptic curves of cryptographic interest with a given embedding degree and small complex multiplication discriminant may ... More
Reviewed: Reviewed
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: 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: journal article
Identifier: http://hdl.handle.net/1959.14/9947
Description: Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic curves with low embedding degree, which are also of importance for pairing-based cryptography. We gi ... More
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/80598
Description: We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/79990
Description: 17 page(s)
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last