On bit correlations among preimages of “many to one” one-way functions: — A new approach to study on randomness and hardness of one-way functions —

Kouichi Sakurai, Toshiya Itoh

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

Abstract

This paper presents a new measure of the complexity of many to one functions. We study bit correlations among the preimages of an element of the range of many to one one-way functions. Especially, we investigate the correlation among the least significant bit of the preimages of 2 to 1 one-way functions based on algebraic problems such as the factorization and the discrete logarithm.

Original languageEnglish
Title of host publicationAdvances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
EditorsJennifer Seberry, Yuliang Zheng
PublisherSpringer Verlag
Pages435-446
Number of pages12
ISBN (Print)9783540572206
Publication statusPublished - Jan 1 1993
EventWorkshop on the Theory and Application of Cryptographic Techniques, AUSCRYPT 1992 - Gold Coast, Australia
Duration: Dec 13 1992Dec 16 1992

Publication series

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

Other

OtherWorkshop on the Theory and Application of Cryptographic Techniques, AUSCRYPT 1992
CountryAustralia
CityGold Coast
Period12/13/9212/16/92

Fingerprint

Many to one
One-way Function
Hardness
Randomness
Discrete Logarithm
Factorization
Range of data

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sakurai, K., & Itoh, T. (1993). On bit correlations among preimages of “many to one” one-way functions: — A new approach to study on randomness and hardness of one-way functions —. In J. Seberry, & Y. Zheng (Eds.), Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 435-446). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 718 LNCS). Springer Verlag.

On bit correlations among preimages of “many to one” one-way functions : — A new approach to study on randomness and hardness of one-way functions —. / Sakurai, Kouichi; Itoh, Toshiya.

Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Jennifer Seberry; Yuliang Zheng. Springer Verlag, 1993. p. 435-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 718 LNCS).

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

Sakurai, K & Itoh, T 1993, On bit correlations among preimages of “many to one” one-way functions: — A new approach to study on randomness and hardness of one-way functions —. in J Seberry & Y Zheng (eds), Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 718 LNCS, Springer Verlag, pp. 435-446, Workshop on the Theory and Application of Cryptographic Techniques, AUSCRYPT 1992, Gold Coast, Australia, 12/13/92.
Sakurai K, Itoh T. On bit correlations among preimages of “many to one” one-way functions: — A new approach to study on randomness and hardness of one-way functions —. In Seberry J, Zheng Y, editors, Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 1993. p. 435-446. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sakurai, Kouichi ; Itoh, Toshiya. / On bit correlations among preimages of “many to one” one-way functions : — A new approach to study on randomness and hardness of one-way functions —. Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Jennifer Seberry ; Yuliang Zheng. Springer Verlag, 1993. pp. 435-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{da0e9c16bd354a4bbed8e92193909b90,
title = "On bit correlations among preimages of “many to one” one-way functions: — A new approach to study on randomness and hardness of one-way functions —",
abstract = "This paper presents a new measure of the complexity of many to one functions. We study bit correlations among the preimages of an element of the range of many to one one-way functions. Especially, we investigate the correlation among the least significant bit of the preimages of 2 to 1 one-way functions based on algebraic problems such as the factorization and the discrete logarithm.",
author = "Kouichi Sakurai and Toshiya Itoh",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "9783540572206",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "435--446",
editor = "Jennifer Seberry and Yuliang Zheng",
booktitle = "Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings",
address = "Germany",

}

TY - GEN

T1 - On bit correlations among preimages of “many to one” one-way functions

T2 - — A new approach to study on randomness and hardness of one-way functions —

AU - Sakurai, Kouichi

AU - Itoh, Toshiya

PY - 1993/1/1

Y1 - 1993/1/1

N2 - This paper presents a new measure of the complexity of many to one functions. We study bit correlations among the preimages of an element of the range of many to one one-way functions. Especially, we investigate the correlation among the least significant bit of the preimages of 2 to 1 one-way functions based on algebraic problems such as the factorization and the discrete logarithm.

AB - This paper presents a new measure of the complexity of many to one functions. We study bit correlations among the preimages of an element of the range of many to one one-way functions. Especially, we investigate the correlation among the least significant bit of the preimages of 2 to 1 one-way functions based on algebraic problems such as the factorization and the discrete logarithm.

UR - http://www.scopus.com/inward/record.url?scp=85028845577&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028845577&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85028845577

SN - 9783540572206

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 435

EP - 446

BT - Advances in Cryptology ― AUSCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - Seberry, Jennifer

A2 - Zheng, Yuliang

PB - Springer Verlag

ER -