Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 8 of 8.

Add to Quick Collection   All 8 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/172505
Description: We give an upper 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 exist, and pr ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130393
Description: 6 page(s)
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/92393
Description: It has been shown by J.-P. Serre that the largest possible number of Fq-rational points on curves of small genus over the finite field Fq of q elements depends on the divisibility property p | [2q½], ... More
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130337
Description: We show that for a fixed integer base g ≥ 2 the palindromes to base g which are k-powers form a very thin set in the set of all base g palindromes. On the other hand, we also give a lower bound which ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1089888
Description: 8 page(s)
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: 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
  • First
  • Previous
  • 1
  • Next
  • Last