Using Set Theoretic Estimation to Implement Shannon Secrecy

Carlson, Albert; Wells, Richard B.; Hiromoto, Robert E.

doi:10.1109/idaacs.2005.283018

Cited by 3 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each meta-symbol is analyzed for common language statistics based on their appearance in English. Language statistics constitute property sets that can be exploited using Set Theoretic Estimation (STE) and Set Methodology [2,10]. The STE property sets used in the attack are listed in Table 1.…”

Section: Example Attacksmentioning

confidence: 99%

“…The decryption method takes the following form: Form sequences of two allowed 2-grams meta(2,2), e.g., etru, isis, isth, ruth, thet, this Form a correspondence between like and unlike patterns using symbols such as A and B (Table 3.2) where A is different from B and vice versa. Form their associated patterns of meta (2,3) in Table 4. Form their associated matching patterns of (2,4) in Table 5.…”

Section: Meta-2-gram Examplementioning

confidence: 99%

“…In this paper, we apply a rule-based set theoretic estimation (STE) [2] approach to capture the properties of m-grams that are derived from a stylistic use of the English language. We treat the resulting collection of m-grams as an a priori property set that is used to analyze the frequency distribution of m-grams symbols and as predictors for either allowed or forbidden letter combinations.…”

Section: Introductionmentioning

confidence: 99%

“…maximum window size of four then Form sequences of four allowed 2-grams meta(2,4) etruthis, isthetru, ruthisth, thetruth, thisthet…”

mentioning

confidence: 99%

See 3 more Smart Citations

Breaking Block and Product Ciphers

Carlson¹,

Hiromoto²,

Wells³

2014

IJC

View full text Add to dashboard Cite

The security of block and product ciphers is considered using a set theoretic estimation (STE) approach to decryption. Known-ciphertext attacks are studied using permutation (P) and substitution (S) keys. The blocks are formed from two (2) alphabetic characters (meta-characters) where the applications of P and S upon the ASCII byte representation of each of the two characters are allowed to cross byte boundaries. The application of STE forgoes the need to employ chosen-plaintext or known-plaintext attacks.

show abstract

Section: Example Attacksmentioning

confidence: 99%

Section: Meta-2-gram Examplementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…maximum window size of four then Form sequences of four allowed 2-grams meta(2,4) etruthis, isthetru, ruthisth, thetruth, thisthet…”

mentioning

confidence: 99%

See 2 more Smart Citations