How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
Attacks on some RSA signatures
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Some variations on RSA signatures and their security
Proceedings on Advances in cryptology---CRYPTO '86
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
2n-BIT hash-functions using n-BIT symmetric block cipher algorithms
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Confirmation that some hash functions are not collision free
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the design of provably-secure cryptographic hash functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Digital signatures with RSA and other public-key cryptosystems
Communications of the ACM
Duality between Two Cryptographic Primitives
AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Structural Properties of One-way Hash Functions
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Structured Design of Substitution-Permutation Encryption Networks
IEEE Transactions on Computers
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We prove that if f is a n-bit one-way permutation, i.e., it has some hard bits, a one-way permutation with n - k provably simultaneous hard bits can be constructed with it. We apply this construction to improve the efficiency of Blum-Micali pseudo-random bit generator. Then, we apply the construction to propose a new approach for building universal one-way hash functions. This approach merges Damgard's design principle (or Merkle's meta-method) and the method proposed by Zheng, Matsumoto and Imai for the construction of hash functions for long messages.