Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers
Information Processing Letters
Success probability of the Hellman trade-off
Information Processing Letters
Refresh: weak privacy model for RFID systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Review: Privacy versus scalability in radio frequency identification systems
Computer Communications
An optimal probabilistic solution for information confinement, privacy, and security in RFID systems
Journal of Network and Computer Applications
Succinct representations of permutations and functions
Theoretical Computer Science
A novel time-memory trade-off method for password recovery
Digital Investigation: The International Journal of Digital Forensics & Incident Response
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Gone in 360 seconds: Hijacking with Hitag2
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Development and performance analysis of HPC based framework for cryptanalytic attacks
Proceedings of the CUBE International Information Technology Conference
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Information confinement, privacy, and security in RFID systems
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
On the sosemanuk related Key-IV sets
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Cracking associative passwords
NordSec'12 Proceedings of the 17th Nordic conference on Secure IT Systems
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
A new variant of time memory trade-off on the improvement of thing and ying's attack
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Applying time-memory-data trade-off to plaintext recovery attack
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
On the algebraic attack against summation type keystream generators
International Journal of Information and Computer Security
Improved anonymity for key-trees
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
An analysis of chain characteristics in the cryptanalytic TMTO method
Theoretical Computer Science
Square reflection cryptanalysis of 5-round Feistel networks with permutations
Information Processing Letters
International Journal of Security and Networks
| Hi-index | 754.84 |
A probabilistic method is presented which cryptanalyzes anyNkey cryptosystem inN^{2/3}operational withN^{2/3}words of memory (average values) after a precomputation which requiresNoperations. If the precomputation can be performed in a reasonable time period (e.g, several years), the additional computation required to recover each key compares very favorably with theNoperations required by an exhaustive search and theNwords of memory required by table lookup. When applied to the Data Encryption Standard (DES) used in block mode, it indicates that solutions should cost between1 and100 each. The method works in a chosen plaintext attack and, if cipher block chaining is not used, can also be used in a ciphertext-only attack.