Macquarie University, Sydney Macquarie University ResearchOnline
RSA

Showing items 1 - 11 of 11.

Add to Quick Collection   All 11 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2017
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1248256
Description: This article proposes a novel architecture to perform modular multiplication in the Residue Number System (RNS) by using sum of residues. The highly parallel architecture is implemented using VHDL and ... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1102117
Description: In mobile communication, spatial queries pose a serious threat to user location privacy because the location of a query may reveal sensitive information about the mobile user. In this paper, we study ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/280377
Description: This work contributes to the modular multiplication operation C = A x B, the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography (ECC). We use the Residue Number Syste ... More
Reviewed: Reviewed
Date: 2012
Subject Keyword: RSA | HPC | integer factorization
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/119710
Description: Published online 24 December 2010. In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 year ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148602
Description: 15 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146689
Description: We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli M=pl, where p and l are primes, with prescribed bit ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148022
Description: 14 page(s)
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/7836
Description: We give a polynomial time probabilistic algorithm that constructs an RSA modulus M=pl, where p and l are two n-bit primes, which has about n/2 bits, on certain positions, prescribed in advance. Althou ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100695
Description: Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the attractive feature of ... More
Reviewed: Reviewed
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: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1153619
Description: An RSA modulus is a product M = pl of two primes p and l. We show that for almost all RSA moduli M, the number of sparse exponents e (which allow for fast RSA encryption) with the property that gcd(e, ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last