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: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/125241
Description: Recently, multisequences have gained increasing interest for applications in cryptography and quasi-Monte Carlo methods. We study the (generalized) joint linear complexity of a class of nonlinear pseu ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/25127
Description: We consider the problem of determining the period of a sequence over an unknown finite field, given a black-box which returns only a few most significant bits of the sequence elements. For sequences w ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/9989
Description: We construct systems of bases of ℂ<sup>n</sup> which are mutually almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on bounds of classical ex ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/101357
Description: We prove a discrepancy bound “on average” over all initial values aα(0)=α of congruential pseudorandom numbers obtained from the sequences aα(n) over a finite field of prime order defined by aα(n)=naα ... More
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146589
Description: 8 page(s)
Full Text: Full Text
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146784
Description: We consider a polynomial analogue of the hidden number problem introduced by Boneh and Venkatesan, namely the sparse polynomial noisy interpolation problem of recovering an unknown polynomial f(X) ∈ M ... More
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146590
Description: We give a relation between the linear complexity over the integers and over the residue rings modulo m of a bounded integer sequence. This relation can be used to obtain a variety of new results for s ... More
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1099489
Description: 13 page(s)
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last