Provably indeterminate 128-bit cipher
There is described a class of the encryption functions based on data-dependent selection of subkeys. Such functions are proposed for elaboration of the indeterminate ciphers with very large number of different modifications of the cryptalgorithm. A 128-bit undetermined cipher is described. The numbe...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
1997-08-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v5-n2/v5-n2-(pp185-197).pdf |
| _version_ | 1798042138953383936 |
|---|---|
| author | N. Moldovyan |
| author_facet | N. Moldovyan |
| author_sort | N. Moldovyan |
| collection | DOAJ |
| description | There is described a class of the encryption functions based on data-dependent selection of subkeys. Such functions are proposed for elaboration of the indeterminate ciphers with very large number of different modifications of the cryptalgorithm. A 128-bit undetermined cipher is described. The number of possible modifications is »1020R, where 2 Ј R Ј 7, R is the number of rounds. It is proved that all modifications are unique. |
| first_indexed | 2024-04-11T22:31:21Z |
| format | Article |
| id | doaj.art-ae3631e9f2ff4c21b1458f4d02d1298c |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-11T22:31:21Z |
| publishDate | 1997-08-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-ae3631e9f2ff4c21b1458f4d02d1298c2022-12-22T03:59:25ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40421997-08-0152(14)185197Provably indeterminate 128-bit cipherN. Moldovyan0Institute of Modelling and Intellectualization of Complex Systems, Prof.\ Popov Str., 5, St-Petersburg, 197376, RussiaThere is described a class of the encryption functions based on data-dependent selection of subkeys. Such functions are proposed for elaboration of the indeterminate ciphers with very large number of different modifications of the cryptalgorithm. A 128-bit undetermined cipher is described. The number of possible modifications is »1020R, where 2 Ј R Ј 7, R is the number of rounds. It is proved that all modifications are unique.http://www.math.md/nrofdownloads.php?file=/files/csjm/v5-n2/v5-n2-(pp185-197).pdfsoftware encryptionindeterminate algorithmblock cipherflexible cryptosystem |
| spellingShingle | N. Moldovyan Provably indeterminate 128-bit cipher Computer Science Journal of Moldova software encryption indeterminate algorithm block cipher flexible cryptosystem |
| title | Provably indeterminate 128-bit cipher |
| title_full | Provably indeterminate 128-bit cipher |
| title_fullStr | Provably indeterminate 128-bit cipher |
| title_full_unstemmed | Provably indeterminate 128-bit cipher |
| title_short | Provably indeterminate 128-bit cipher |
| title_sort | provably indeterminate 128 bit cipher |
| topic | software encryption indeterminate algorithm block cipher flexible cryptosystem |
| url | http://www.math.md/nrofdownloads.php?file=/files/csjm/v5-n2/v5-n2-(pp185-197).pdf |
| work_keys_str_mv | AT nmoldovyan provablyindeterminate128bitcipher |