Loading... The system can't perform the operation now. Try again later.
Advanced searchArticlesCase lawProfiles My profileMy libraryAlertsMetrics Settings Sign in Sign in ArticlesScholar 1 result (0.03 sec) My profileMy library
bits where m> t, then there exists a computationally collision free function h mapping
messages of arbitrary polynomial lengths to t-bit strings. Let n be the length of the message.
h can be constructed either such that it can be evaluated in time linear in n using 1
processor, or such that it takes time O (log (n)) using O (n) processors, counting evaluations
of f as one step. Finally, for any constant k and large n, a speedup by a factor of k over the Cited by 1302 Related articles All 11 versions HelpPrivacyTerms