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: 2005
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148331
Description: 11 page(s)
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/133006
Description: We show how to accelerate the subset sum pseudorandom number generator with arbitrary weights. Some special choices of weights speed up the naive usage of this generator without losing the property of ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1197318
Description: Given two sets A and B of integers, we consider the problem of finding a set S⊆A of the smallest possible cardinality such the greatest common divisor of the elements of S∪B equals that of those of A∪ ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148652
Description: We consider the following computational problem: we are given two coprime univariate polynomials f₀ and f₁ over a ring R and want to find whether after a small perturbation we can achieve a large gcd. ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/119857
Description: 8 page(s)
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1197328
Description: Safe primes and safe RSA moduli are used in several cryptographic schemes. The most common notion is that of a prime P, where (p - 1)/2 is also prime. The latter is then a Sophie Germain prime. Under ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/16983
Description: We show that for arbitrary positive integers a₁, . . . , am, with probability 6/π² + o(1), the gcd of two linear combinations of these integers with rather small random integer coefficients coincides ... More
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118576
Description: One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We present a lower bound Ω ... More
Full Text: Full Text
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last