Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generic Case Complexity and One-Way Functions

Generic Case Complexity and One-Way Functions The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavior of an algorithm on “most” inputs in a simple and intuitive fashion which has some practical advantages over classical methods based on averaging. We present an alternative definition of one-way function using the concepts of generic case complexity and show its equivalence to the standard definition. In addition we demonstrate the convenience of the new approach by giving a short proof that extending adversaries to a larger class of partial algorithms with errors does not change the strength of the security assumption. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Generic Case Complexity and One-Way Functions

Groups - Complexity - Cryptology , Volume 1 (1) – Apr 1, 2009

Loading next page...
 
/lp/de-gruyter/generic-case-complexity-and-one-way-functions-OIG0xtrZBF
Publisher
de Gruyter
Copyright
© Heldermann Verlag
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2009.13
Publisher site
See Article on Publisher Site

Abstract

The goal of this paper is to introduce ideas and methodology of the generic case complexity to cryptography community. This relatively new approach allows one to analyze the behavior of an algorithm on “most” inputs in a simple and intuitive fashion which has some practical advantages over classical methods based on averaging. We present an alternative definition of one-way function using the concepts of generic case complexity and show its equivalence to the standard definition. In addition we demonstrate the convenience of the new approach by giving a short proof that extending adversaries to a larger class of partial algorithms with errors does not change the strength of the security assumption.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Apr 1, 2009

There are no references for this article.