Macquarie University, Sydney Macquarie University ResearchOnline

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: 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/117339
Description: The cryptographic hash function literature has numerous hash function definitions and hash function requirements, and many of them disagree. This survey talks about the various definitions, and takes ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116920
Description: 17 page(s)
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/118561
Description: In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differentials existing for the st ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116766
Description: In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/43466
Description: Given an integer n, how hard is it to find the set of all integers m such that φ(m) = n, where φ is the Euler totient function? We present a certain basic algorithm which, given the prime number facto ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100898
Description: In this paper, we analyze the security of HMAC and NMAC, both of which are hash-based message authentication codes. We present distinguishing, forgery, and partial key recovery attacks on HMAC and NMA ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100899
Description: We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-b ... More
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116703
Description: 15 page(s)
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1245100
Description: 9 page(s)
Reviewed: Reviewed
Date: 2004
Subject Keyword: 080400 Data Format
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/29188
Description: SecurID is a widely used hardware token for strengthening authentication in a corporate environment. Recently, Biryukov, Lano, and Preneel presented an attack on the alleged SecurID hash function. The ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last