Solving XOR Plaintext Strings with the Viterbi Algorithm

Griffing, Alexander R.

doi:10.1080/01611190600630386

Cited by 3 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6]). For other interesting cryptanalytic applications of that model the reader is referred to [17] and [18].…”

Section: 2mentioning

confidence: 99%

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

Angelova¹,

Borissov²

2014

SJC

View full text Add to dashboard Cite

We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers.ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.

show abstract

“…6]). For other interesting cryptanalytic applications of that model the reader is referred to [17] and [18].…”

Section: 2mentioning

confidence: 99%

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

Angelova¹,

Borissov²

2014

SJC

View full text Add to dashboard Cite

show abstract

“…This article is a follow-up to [5], which shows how the Viterbi algorithm can solve running key ciphers in which the spaces are kept in the message and key, and for which the letters of the message and key are combined using bitwise XOR.…”

Section: Introductionmentioning

confidence: 99%

Solving the Running Key Cipher with the Viterbi Algorithm

Griffing¹

2006

Cryptologia

Self Cite

View full text Add to dashboard Cite

show abstract

“…N-gram analysis [18,27] can be used in conjunction with frequency analysis or on its own. Like frequency analysis, lists of n-character strings, or n-grams, can be tallied from a representative training set.…”

Section: Common Methodsmentioning

confidence: 99%

“…Much of the related work on algorithms [18,27,42] and implementations [40,9] of cryptanalysis on two-time pads was already discussed in Sections 3.1 and 3.2. Most of the work reviewing two-time pad vulnerabilities is explored in the context of network communications.…”

Section: Related Workmentioning

confidence: 99%

When cryptography meets storage

Diesburg

Meyers

Lary

et al. 2008

Proceedings of the 4th ACM International Workshop on Storage Security and Survivability

View full text Add to dashboard Cite

Confidential data storage through encryption is becoming increasingly important.Designers and implementers of encryption methods of storage media must be aware that storage has different usage patterns and properties compared to securing other information media such as networks. In this paper, we empirically demonstrate two-time pad vulnerabilities in storage that are exposed via shifting file contents, in-place file updates, storage mechanisms hidden by layers of abstractions, inconsistencies between memory and disk content, and backups. We also demonstrate how a simple application of Bloom filters can automatically extract plaintexts from two-time pads. Further, our experience sheds light on system research directions to better support cryptographic assumptions and guarantees.

show abstract

Solving XOR Plaintext Strings with the Viterbi Algorithm

Cited by 3 publications

References 8 publications

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

Solving the Running Key Cipher with the Viterbi Algorithm

When cryptography meets storage

Contact Info

Product

Resources

About