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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alexi,W., Chor,B., Goldreich,O., and Schnorr, C.P., “RSA and Rabin functions: Certain Parts are as Hard as the Whole,” SIAM J. on Computing, Vol.17, No.2, pp.194–209 (April 1988).
Bach, E., “Discrete Logarithms and Factoring,” Report No. UCB/CSD 84/186, Univ. of California (1984).
Brassard, G., Chaum, D., and Crépeau, C., “Minimum Disclosure Proofs of Knowledge,” Journal of Computer and System Sciences, Vol.37, No.2, pp.156–189 (1988).
Ben-Or, M., Chor, B., and Shamir, A., “On the cryptographic security of single RSA bits,” Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp.421–430 (1983).
Blum, M., Feldman,P., and Micali, S., “Non-interactive zero-knowledge and its applications,” Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.103–112 (1988).
Blum, M., “Coin Flipping by Telephone,” IEEE Spring COMPCOM (1982).
Blum, M., and Micali, S., “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,” SIAM J. on Computing, Vol.13, pp.850–864 (1984).
Chor, B., Goldreich, O., and Goldwasser, S., “The bit security of modular squaring given partial factorization of the modulus,” Proceedings of CRYPTO'85, Lecture Notes in Computer Science 218, pp.448–457, Springer-Verlag, Berlin (1986).
Damgård,I.B., “Collision Free Hash Functions and Public Key Signature Scheme,” Proceedings of EUROCRYPT87, Lecture Notes in Computer Science 304, Springer-Verlag, pp.203–216, Berlin (1988).
Feige, U., Lapidot, D., and Shamir A., “Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String,” Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp.308–318 (1990).
Goldreich, O., Krawczyk, H. and Luby, M., “On the Existence of Pseudorandom Generator,” Proceedings of the 29st Annual Symposium on Foundations of Computer Science, pp.12–24 (1988).
Goldwasser, S., Micali, S., and Tong, P., “Why and how to establish a private code on a public network,” Proceedings of the 23st Annual Symposium on Foundations of Computer Science, pp.134–144 (1982).
Goldwasser, S., Micali, S., and Rivest, L., “A digital signature scheme against adaptive chosen-message attack,” SIAM J. on Computing, Vol.17, No.2, pp.281–308 (April 1988).
Goldreich.O., and Levin, L.A., “A Hard-Core Predicate for all One-Way Functions,” Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp.25–32 (May 1989).
Goldwasser, S. and Ostrovsky, R. “Non-Interactive Zero-Knowledge Proofs and Invariant Signature are Equivalent,” Preproceedings of CRYPTO'92 (1992).
Håstad, J., “Pseudo-Random Generator under Uniform Assumptions,” Proceedings of the 22th Annual ACM Symposium on Theory of Computing, pp.12–24 (May 1990).
Impagliazzo, R., Levin, L.A., and Luby, M., “Pseudo-random generation from one-way functions,” Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp.12–24 (May 1989).
Kurosawa, K., Ogata, W., and Tsujii, S., “4 Move ZKIP,” IEICE Technical Report, Vol.90, No.125, pp.63–69 (July 1990).
Kurosawa, K., Ogata, W., Sakurai, K., Itoh, T., and Tsujii, S., “4-move zero-knowledge interactive proof systems,” IEICE Technical Report, Vol.90, No.365, pp.7–10 (Dec. 1990).
Kranakis, E., “Primality and cryptography,” Wiley-Teubner Series in Computer Science (1986).
Miller, G., “Riemann's Hypothesis and Test for Primality,” Journal of Computer and System Sciences, Vol.13, pp.300–317 (1976).
Naor,M., “Bit Commitments using Pseudo-Randomness,” Proceedings of CRYPTO'89, Lecture Notes in Computer Science 435, pp.128–136, Springer-Verlag, Berlin (1990).
Naor,M., and Yung,M., “Universal One-way Hash functions and their Cryptographic Applications,” Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pp.33–43 (May 1989).
Okamoto, T., private communication (Oct. 1990).
Rabin,M.O., “Digital Signatures and public key functions as intractable as factorization,” Technical Memo TM-212, LCS/MIT (1919).
Russell A., “Necessary and Sufficient Conditions for Collision-Free Hashing,” Preproceedings of Crypto'92, (1992).
Sakurai,K., and Itoh,T., “On the Distribution of a Hard Bit of Square Roots Modulo a Product of Two Distinct Odd Primes,” Manuscript (Oct. 1990).
Schrift, A.W. and Shamir, A. “The Discrete Log is very Discrete,” Proceedings of the 22th Annual ACM Symposium on Theory of Computing, pp.405–415 (May 1990).
Woll, H., “Reductions among Number Theoretic Problems,” Information and computation, 72, pp.167–179 (1987).
Yao, A.C. “Theory and applications of trapdoor functions,” Proceedings of the 23st Annual Symposium on Foundations of Computer Science, pp.80–91 (1982).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakurai, K., Itoh, T. (1993). On bit correlations among preimages of “Many to one” One-way functions. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_81
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive