##plugins.themes.academic_pro.article.main##
Abstract
In article the report of the electronic digital signature on the basis of asymmetric algorithm of the enciphering based on complexity of decomposition on a proverse of numbers enough of the big natural number is developed. At which formation in process of the digital signature possibility a choice of any number from the signed is provided.
Keywords
matrix
matrixparametric multiplication
encryption
algorithm
##plugins.themes.academic_pro.article.details##
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
Akhmadaliev Shakhobidin Sharifovich, Hasanov Xayrullo Maxmudovich, & Botirov Muzaffar Mansurovich. (2022). Protocol For Electronic Digital Signature of Asymmetric Encryption Algorithm, Based on Asymmetric Encryption Algorithm Based on the Complexity of Prime Decomposition of a Sufficiently Large Natural Number. Texas Journal of Multidisciplinary Studies, 7, 238–241. Retrieved from https://zienjournals.com/index.php/tjm/article/view/1299
References
- Alferov A. P., Zubov A. Yu., Kuzmin A. S., Cheremushkin A. V. Osnovy cryptography: Uchebnoe posobie, 2-e ed. –M.: Helios ARV, 2002.-480 p.
- Schneier B. Applied cryptography. Protocols, algorithms, source texts in the language of C. –M.: PUBLISHING HOUSE TRIUMPH, 2003 - 816 p.
- Акбаров Д.Е. Ахборот хавфсизлигини таъминлашнинг криптографик усуллари ва уларнинг қўлланилиши – Тошкент, “Ўзбекистон маркаси”, 2009 – 434 бет.
- Khasanov P.F., Akbarov D. E., Akhmadliev Sh. Sh. Methods of creating new asymmetric algorithms based on subject-shaped complexes using parameter algebra actions. / Infocommunications: Networks-Technologies-Solutions. -1(9)/2009. -p. 31-35.