Asymmetric cryptosystems on Boolean functions
Here, we define an asymmetric substitution cryptosystem combining both a public key cipher and a signature scheme with the functional keys. A public key in the cryptosystem is a vector Boolean function f(x1,... ,xn) of a dimension n. This function is obtained by permutation and negation operations o...
| Published in: | Прикладная дискретная математика № 40. С. 23-33 |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000629981 Перейти в каталог НБ ТГУ |