Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 13 of 13.

Add to Quick Collection   All 13 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/195847
Description: We introduce and study algebraic dynamical systems generated by triangular systems of rational functions. We obtain several results about the degree growth and linear independence of iterates as well ... More
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: 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: 2004
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1231948
Description: 10 page(s)
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1245282
Description: 6 page(s)
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/118700
Description: We describe an authentication scheme whose security is based on the hardness of finding roots of systems of sparse polynomial equations in many variables and of high degree. One of the new ideas is th ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: book
Identifier: http://hdl.handle.net/1959.14/75292
Description: The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Cryptographers and number theorists will f ... More
Date: 2003
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1245118
Description: 12 page(s)
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118610
Description: We solve two computational problems concerning plane algebraic curves over finite fields: generating a uniformly random point, and finding all points deterministically in amortized polynomial time (ov ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1147938
Description: We consider a generalisation of the hidden number problem recently introduced by Boneh and Venkatesan. The initial problem can be stated as follows: recover a number a ∈ double-struck F signp such tha ... More
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/79986
Description: We obtain new lower bounds on the linear complexity of several consecutive values of the discrete logarithm modulo a prime p. These bounds generalize and improve several previous results.
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: book
Identifier: http://hdl.handle.net/1959.14/75128
Description: Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer scienc ... More
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