A Design Principle for Hash Functions
暂无分享,去创建一个
[1] Brigitte Vallée,et al. Computation of Approximate L-th Roots Modulo n and Application to Cryptography , 1988, CRYPTO.
[2] Moni Naor,et al. Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.
[3] Philippe Godlewski,et al. Manipulations and Errors, Detection and Localization , 1988, EUROCRYPT.
[4] S. Wolfram. Random sequence generation by cellular automata , 1986 .
[5] Marc Girault,et al. Hash-Functions Using Modulo-N Operations , 1987, EUROCRYPT.
[6] Ralph C. Merkle,et al. One Way Hash Functions and DES , 1989, CRYPTO.
[7] Robert S. Winternitz. Producing a One-Way Hash Function from DES , 1983, CRYPTO.
[8] Dorothy E. Denning,et al. Programming Techniques and Data Structures Digital Signatures with Rsa and Other Public.key , 2022 .
[9] Ivan Damgård,et al. Collision Free Hash Functions and Public Key Signature Schemes , 1987, EUROCRYPT.
[10] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.