See Also:
Add to Quick Collection
All 10 Results
Showing items 1 - 10 of 10.
Add All Items to Quick Collection
Source: Прикладная дискретная математика. 2020. № 50. С. 62-71
Type: статьи в журналах
Date: 2020
Description:
The paper continues an investigation of the cryptanalytical invertibility concept of finite automata with a finite delay introduced by the author in his previous papers where he also gave a constructi
... More
Source: Прикладная дискретная математика. 2019. № 44. С. 34-42
Type: статьи в журналах
Date: 2019
Description:
The automaton invertibility with a finite delay plays a very important role in the analysis and synthesis of finite automata cryptographic systems. The automaton cryptanalitic invertibility with a fin
... More
Source: Прикладная дискретная математика. 2019. № 46. С. 27-37
Type: статьи в журналах
Date: 2019
Description:
The paper continues an investigation of the cryptanalytical invertibility concept with a finite delay introduced by the author for finite automata. Here, we expound an algorithmic test for an automato
... More
Source: Прикладная дискретная математика. 2018. № 40. С. 23-33
Type: статьи в журналах
Date: 2018
Description:
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 functio
... More
Source: Прикладная дискретная математика. 2018. № 42. С. 57-65
Type: статьи в журналах
Date: 2018
Description:
Here is a description of ElGamal public-key encryption and digital signature schemes constructed on the base of bijective systems of Boolean functions. The description is illustrated with a simple exa
... More
Source: Прикладная дискретная математика. Приложение. 2017. № 10. С. 106-110
Type: статьи в журналах
Date: 2017
Description:
This conference paper is an extended abstract of a recent article in Prikladnaya Diskretnaya Matematika (2017, No.36), where we presented the definition of the cryptautomata and described some cryptan
... More
Source: Прикладная дискретная математика. 2017. № 38. С. 57-65
Type: статьи в журналах
Date: 2017
Description:
We define a substitution block cipher C with the plaintext and ciphertext blocks in Fn and with the keyspace Ks0,n(g) that is the set { / (x) : f (x) = n2(ga2(ni(xCTl))); a,a2 e F /;n1,n2 e Sn}, where
... More
Source: Прикладная дискретная математика. 2016. № 1. С. 62-66
Type: статьи в журналах
Date: 2016
Description:
In order to protect both data confidentiality and legality, a concept of a watermarking cipher (also called a w-cipher) is defined. The main idea of this cjncept is as follows: the transformation of a
... More
Source: Прикладная дискретная математика. Приложение. 2013. № 6. С. 93-98
Type: статьи в журналах
Date: 2013
Source: Прикладная дискретная математика. Приложение. 2013. № 6. С. 98-102
Type: статьи в журналах
Date: 2013
