A Time-Memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Moderately hard, memory-bound functions
ACM Transactions on Internet Technology (TOIT)
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables
ACM Transactions on Information and System Security (TISSEC)
Basing weak public-key cryptography on strong one-way functions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
The cost of false alarms in Hellman and rainbow tradeoffs
Designs, Codes and Cryptography
Time space tradeoffs for attacks against one-way functions and PRGs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
New applications of time memory data tradeoffs
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Time-Memory trade-offs: false alarm detection using checkpoints
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Security weaknesses of certain broadcast encryption schemes
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Rigorous bounds on cryptanalytic time/memory tradeoffs
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
We provide rigorous time/space trade-offs for inverting any function. Given a function f, we give a time/space trade-off of T S2 = N3 q(f), where q(f) is the probability that two random elements (taken with replacement) are mapped to the same image under f. We also give a more general trade-off, T S3 = N3, that can invert any function at any point.