Name
Abstract | ||
|---|---|---|
A Shannon cipher can be used as a building block for the block cipher construction if it is considered as one data block cipher. It has been proved that a Shannon cipher based on a matrix power function (MPF) is perfectly secure. This property was obtained by the special selection of algebraic structures to define the MPF. In an earlier paper we demonstrated, that certain MPF can be treated as a conjectured one-way function. This property is important since finding the inverse of a one-way function is related to an NP-complete problem. The obtained results of perfect security on a theoretical level coincide with the NP-completeness notion due to the well known Yao theorem. The proposed cipher does not need multiple rounds for the encryption of one data block and hence can be effectively parallelized since operations with matrices allow this effective parallelization. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3390/sym12050860 | SYMMETRY-BASEL |
Keywords | DocType | Volume |
Shannon cipher,symmetric encryption,perfect security,block cipher | Journal | 12 |
Issue | Citations | PageRank |
5 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eligijus Sakalauskas | 1 | 28 | 8.15 |
| Lina Dindiene | 2 | 0 | 0.34 |
| Ausrys Kilciauskas | 3 | 0 | 0.34 |
| Kestutis Luksys | 4 | 0 | 0.34 |