Random sequence generation by cellular automata
Advances in Applied Mathematics
Manipulations and errors, detection and localization
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Digital signatures with RSA and other public-key cryptosystems
Communications of the ACM
Computation of Approximate L-th Roots Modulo n and Application to Cryptography
CRYPTO '88 Proceedings of the 8th 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
Efficient cryptographic schemes provably as secure as subset sum
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Hash-functions using modulo-N operations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Differential cryptanalysis of hash functions based on block ciphers
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
Eliminating counterevidence with applications to accountable certificate management
Journal of Computer Security
A new key authentication scheme based on discrete logarithms
Applied Mathematics and Computation
Decorrelation over Infinite Domains: The Encrypted CBC-MAC Case
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Pseudorandom recursions: small and fast pseudorandom number generators for embedded applications
EURASIP Journal on Embedded Systems
Message Authentication Protocol Based on Cellular Automata
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
An efficient and scalable key distribution mechanism for hierarchical wireless sensor networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
TWISTERπ – a framework for secure and fast hash functions
International Journal of Applied Cryptography
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Keyed hash function based on a chaotic map
Information Sciences: an International Journal
Logical analysis of hash functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Arbitrated quantum signature of classical messages without using authenticated classical channels
Quantum Information Processing
| Hi-index | 0.00 |
We show that if there exists a computationally collision free function f from m bits to t bits where m t, then there exists a computationally collision free function h mapping messages of arbitrary polynomial lengths to t-bit strings.Let n be the length of the message, h can be constructed either such that it can be evaluated in time linear in n using 1 processor, or such that it takes time O(log(n)) using O(n) processors, counting evaluations of f as one step. Finally, for any constant k and large n, a speedup by a factor of k over the first construction is available using k processors.Apart from suggesting a generally sound design principle for hash functions, our results give a unified view of several apparently unrelated constructions of hash functions proposed earlier. It also suggests changes to other proposed constructions to make a proof of security potentially easier.We give three concrete examples of constructions, based on modular squaring, on Wolfram's pseudoranddom bit generator [Wo], and on the knapsack problem.