Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 361 - 373 of 373.

Add to Quick Collection   All 373 Results

Sort:
 Add All Items to Quick Collection
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118667
Description: Let us fix a security parameter n and a sufficiently large encryption exponent e. We show that for a random choice of the RSA modulus m=pq, where p and q are n-bit primes, the decryption exponent d, d ... More
Reviewed: Reviewed
Date: 2004
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118682
Description: Boneh and Venkatesan have recently proposed an approach to proving that a reasonably small portions of most significant bits of the Diffie–Hellman key modulo a prime are as secure as the whole key. So ... More
Reviewed: Reviewed
Date: 2004
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/78673
Description: 16 page(s)
Reviewed: Reviewed
Date: 2003
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/78679
Description: It is shown that the method of estimation of exponential sums with nonlinear recurring sequences, invented by the authors in a recent series of works, can be applied to estimating sums of multiplicati ... More
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/119883
Description: We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new nonlinear generator called quadrati ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2003
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/78682
Description: We extend to the setting of polynomials over a finite field certain estimates for short Kloosterman sums originally due to Karatsuba. Our estimates are then used to establish some uniformity of distri ... More
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/79990
Description: 17 page(s)
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/119902
Description: 62 page(s)
Date: 2001
Language: eng
Resource Type: book
Identifier: http://hdl.handle.net/1959.14/118544
Description: 398 page(s)
Date: 2001
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118588
Description: Let g be a primitive root modulo a (n+1)-bit prime p. In this paper we prove the uniformity of distribution of the Diffie--Hellman triples (gx, gy, gxy) as the exponents x and y run through the set of ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1233606
Description: 10 page(s)
Reviewed: Reviewed
Date: 2000
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/119050
Description: We obtain a lower bound on the linear complexity profile of the power generator of pseudo-random numbers modulo a Blum integer. A different method is also proposed to estimate the linear complexity pr ... More
Full Text: Full Text
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