product ciphers
Recently Published Documents


TOTAL DOCUMENTS

8
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2014 ◽  
pp. 259-266
Author(s):  
Albert H. Carlson ◽  
Robert E. Hiromoto ◽  
Richard B. Wells

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.


2007 ◽  
Vol 177 (8) ◽  
pp. 1789-1795
Author(s):  
Vasilios Katos ◽  
Bernard Doherty

2000 ◽  
Vol 8 (2-3) ◽  
pp. 141-158 ◽  
Author(s):  
John Kelsey ◽  
Bruce Schneier ◽  
David Wagner ◽  
Chris Hall
Keyword(s):  

Author(s):  
John Kelsey ◽  
Bruce Schneier ◽  
David Wagner ◽  
Chris Hall
Keyword(s):  

1994 ◽  
Vol 23 (490) ◽  
Author(s):  
Lars Ramkilde Knudsen

In this paper we consider conventional cryptosystems. We illustrate the differences between substitution, transposition and product ciphers by showing encryptions of a highly redundant cleartext, a portrait. Also it is pictorially demonstrated that no conventional cryptosystem in its basic mode provides sufficient security for redundant cleartexts.


Cryptologia ◽  
1989 ◽  
Vol 13 (4) ◽  
pp. 303-326 ◽  
Author(s):  
John M. Carroll ◽  
Lynda E. Robbins
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document