Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 17.

Add to Quick Collection   All 17 Results

Sort:
 Add All Items to Quick Collection
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/202843
Description: We consider the problem of recovering a hidden element s of a finite field Fq of q elements from queries to an oracle that for a given x ∈ Fq returns (x+s)e for a given divisor e | q - 1. We use some ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146993
Description: We obtain some theoretical and experimental results concerning various properties (the number of fixed points, image distribution, cycle lengths) of the dynamical system naturally associated with Ferm ... More
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146987
Description: 16 page(s)
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/124438
Description: The classical (Bancilhon-Spyratos) correspondence between view update translations and views with a constant complement reappears more generally as the correspondence between update strategies and mee ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/126837
Description: In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic- ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/129659
Description: It is shown that only a fraction of 2-Ω(n) of the graphs on n vertices have an integral spectrum. Although there are several explicit constructions of such graphs, no upper bound for their number has ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/88417
Description: 7 page(s)
Full Text: Full Text
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: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1244068
Description: 7 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/81856
Description: We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrice ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148292
Description: 8 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/327690
Description: We give a brief survey of several recently suggested constructions of generating sequences of pseudorandom points on elliptic curves. Such constructions are of interest for both classical and elliptic ... 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: conference paper
Identifier: http://hdl.handle.net/1959.14/116772
Description: Database watermarking has received significant research attention in the current decade. Although, almost all watermarking models have been either irreversible (the original relation cannot be restore ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100899
Description: We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-b ... More
Reviewed: Reviewed