Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 5 of 5.

Add to Quick Collection   All 5 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/173394
Description: We give a rigorous deterministic polynomial time algorithm for the modular inversion hidden number problem introduced by D.Boneh, S. Halevi and N.A. Howgrave-Graham in 2001. For our algorithm, we need ... 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: 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: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1153369
Description: Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field (double-struck F sign)p = {0, ..., p-1} of p elements from rather short st ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last