A mathematical problem for security analysis of hash functions and pseudorandom generators

Koji Nuida, Takuro Abe, Shizuo Kaji, Toshiaki Maeno, Yasuhide Numata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The aim of this paper is to emphasize the significance of a certain mathematical problem in research on information security. We point out that the mathematical problem, which we refer to as "Function Density Problem," has connections to the following two major cryptographic topics; security analysis of hash functions in the real world (like SHA-1), and construction of pseudorandom generators with some enhanced security property. We also provide a first example to show how a study of Function Density Problem can contribute to the progress of the above-mentioned two topics. Other potential applications of Function Density Problem to information security are also discussed.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - 6th International Workshop, IWSEC 2011, Proceedings
Pages144-160
Number of pages17
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event6th International Workshop on Security, IWSEC 2011 - Tokyo, Japan
Duration: Nov 8 2011Nov 10 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7038 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Workshop on Security, IWSEC 2011
CountryJapan
CityTokyo
Period11/8/1111/10/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A mathematical problem for security analysis of hash functions and pseudorandom generators'. Together they form a unique fingerprint.

Cite this