Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 20.

Add to Quick Collection   All 20 Results

Sort:
 Add All Items to Quick Collection
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1071469
Description: The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routin ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: Thesis PhD
Identifier: http://hdl.handle.net/1959.14/1141525
Description: Empirical thesis.
Full Text: Full Text
Date: [2014]
Language: eng
Resource Type: Thesis PhD
Identifier: http://hdl.handle.net/1959.14/1138411
Description: "December 2013"
Full Text: Full Text
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/217822
Description: This paper presents new explicit formulae for the point doubling, tripling and addition for ordinary Weierstraß elliptic curves with a point of order 3 and their equivalent Hessian curves over finite ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/206025
Description: There has been a recent trend in storing data in the cloud because of the significant benefits, such as on demand resources and low maintenance costs. However due to the distributed nature of the clou ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148080
Description: This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite field $mathbb{F}_q$, it is shown ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130338
Description: We give explicit formulas for the number of distinct elliptic curves over a finite field (up to isomorphism over the algebraic closure of the ground field) in several families of curves of cryptograph ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/129967
Description: Given an elliptic curve E over ℚ we estimate the number of primes p≤T for which the number of points on reduction of E modulo p has a large prime factor ℓ and also a small embedding degree with respec ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/117602
Description: We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/46655
Description: A secret sharing scheme typically requires secure communications in each of two distribution phases: (1) a dealer distributes shares to participants (share distribution phase); and later (2) the parti ... More
Full Text: Full Text
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: 2006
Subject Keyword: cryptography | open systems
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/18037
Description: In this paper, we propose a unified framework for trust management that can cover a broad variety of trust mechanisms including reputations, credentials, local data and environment parameters. The pro ... More
Full Text: Full Text
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/20656
Description: In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudorandom function f (⋅) among n players in such a way that for all the inputs x, any u players can compute f (x) while ... More
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/8419
Description: The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of ... More
Reviewed: Reviewed