Jump to ContentJump to Main Navigation
Show Summary Details
In This Section

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board Member: Blackburn, Simon R. / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Schäge, Sven / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year

CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2015: 1.208
Source Normalized Impact per Paper (SNIP) 2015: 2.294

Mathematical Citation Quotient (MCQ) 2015: 0.48

See all formats and pricing
In This Section

Generic Case Complexity and One-Way Functions

Alex D. Myasnikov
  • Department of Mathematical Sciences, Stevens Institute of Technology, Hoboken, NJ 07030, USA.
Published Online: 2010-02-18 | DOI: https://doi.org/10.1515/GCC.2009.13

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.

About the article

Received: 2008-01-07

Published Online: 2010-02-18

Published in Print: 2009-04-01

Citation Information: Groups – Complexity – Cryptology, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/GCC.2009.13. Export Citation

Comments (0)

Please log in or register to comment.
Log in