Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-Offs

Hong, Jin; Jeong, Ki-Tae; Kwon, Eun Young; Lee, In-Sok; Ma, Daegun

doi:10.1007/978-3-540-79104-1_10

Cited by 14 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Limiting the precomputed table to these points speeds up the realtime phase, since a tablesearch is only required when the known keystream fragment also happens to start with this string. This method offers different advantages against different ciphers: the tradeoff curve itself may change; its range of parameters may expand; and/ or practical speedups (e.g., fewer disk-access operations) may become possible [31,51].…”

Section: Tmdto Attacksmentioning

confidence: 99%

PudgyTurtle: Using Keystream to Encode and Encrypt

August¹,

Smith

2020

SN COMPUT. SCI.

View full text Add to dashboard Cite

Stream cipher encryption works by modulo-2 adding plaintext bits to keystream bits, which are in turn produced by successively updating a finite-state machine initialized to a secret starting state. PudgyTurtle is a way to encode the plaintext in a keystream-dependent manner before encryption. Since it can use keystream from any stream cipher, PudgyTurtle functions somewhat like an encryption mode. The process begins by generating successive 4-bit groups of keystream ('nibbles') until one of them matches the current plaintext nibble to within one bit. The number of keystream nibbles required, as well as the nearness of this match, is then encoded into a variable-length codeword. Finally, this codeword is encrypted by modulo-2 addition to an equal amount of keystream. Compared to normal binary-additive stream ciphers, this process is less efficient (i.e., more time is required to generate extra keystream nibbles, and more space is needed for the codewords than for the plaintext). However, with this cost comes a benefit: PudgyTurtle resists time-memory tradeoff attacks better than standard stream encryption.

show abstract

Section: Tmdto Attacksmentioning

confidence: 99%

PudgyTurtle: Using Keystream to Encode and Encrypt

August¹,

Smith

2020

SN COMPUT. SCI.

View full text Add to dashboard Cite

show abstract

“…Moreover, it can also be used as a ciphertext-only attack by waiting for repeated ciphertext blocks and assuming the corresponding chosen plaintext. There are two main improvements on TMTOs; distinguished points [8], [9], [20], [13] by Rivest and Rainbow tables [18], [1], [2] by Oechslin. Rivest noticed that the number of disk access operations is slower than than the evaluation of encryption function. He suggested to the use distinguished points(DP) to reduce the memory access in the online phase.…”

Section: Introductionmentioning

confidence: 99%

Choosing Parameters to Achieve a Higher Success Rate for Hellman Time Memory Trade Off Attack

Saran

Doğanaksoy

2009

2009 International Conference on Availability, Reliability and Security

View full text Add to dashboard Cite

In 1980, Hellman proposed the Time Memory Trade Off (TMTO) attack and applied it on block cipher DES (Data Encryption Standard). Time Memory Trade Off attack is one of the methods that inverts a one way function. The resistance to TMTO attacks is an important criterion in the design of a modern cipher. Unlike the exhaustive search and table lookup methods, TMTO is a probabilistic method, that is, the search operation may not find a preimage even if there exists one. Up to now, there are some approximate bounds for success rates of Hellman table by Hellman and Kusuda et al. In this study, we give a more precise approximation for the coverage of a single Hellman table.There is no precise guideline in the literature that points out how to choose parameters for Hellman TMTO. We present a detailed analysis of the success rate of Hellman table via new parameters and also show how to choose parameters to achieve a higher success rate. The results are experimentally confirmed. We also discuss the Hellman's TMTO Curve.

show abstract

“…[6], [7]. Njihov predlog predstavlja varijantu DP metoda i nazvan je VDP (Variable Distingushed Points) metod.…”

Section: Metod Karakteristi Nih Ta Akamentioning

confidence: 99%

Balancing between time and memory requirements in cryptanalysis

Tomašević

Tomašević²

2012

2012 20th Telecommunications Forum (TELFOR)

View full text Add to dashboard Cite

Sadržaj -Balansiranje izme u vremenskih i memorijskih zahteva je suština TMTO pristupa i predstavlja jedan od osnovnih preduslova za efikasan postupak kriptoanalize. U ovom radu su, pored klasi nog Hellman-ovog metoda, predstavljeni poboljšani TMTO algoritmi namenjeni i block cipher i stream cipher sistemima. Zatim je data uporedna analiza performansi opisanih postupaka. Na kraju je ukratko opisan predlog novog, deterministi kog kriptoanaliti kog TMTO postupka koji koristi napredne stukture podataka tipa stabala u fazi pripreme i u fazi napada.Klju ne re i -kriptoanaliza, TMTO, rainbow tabele, distinguished points, checkpoints, intervalna stabla.

show abstract

Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-Offs

Cited by 14 publications

References 10 publications

PudgyTurtle: Using Keystream to Encode and Encrypt

PudgyTurtle: Using Keystream to Encode and Encrypt

Choosing Parameters to Achieve a Higher Success Rate for Hellman Time Memory Trade Off Attack

Balancing between time and memory requirements in cryptanalysis

Contact Info

Product

Resources

About