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
Keywords:
matrix, matrixparametric multiplication, encryption, algorithmAbstract
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.
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.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
User Rights
Under the Creative Commons Attribution-NonCommercial 4.0 International (CC-BY-NC), the author (s) and users are free to share (copy, distribute and transmit the contribution).
Rights of Authors
Authors retain the following rights:
1. Copyright and other proprietary rights relating to the article, such as patent rights,
2. the right to use the substance of the article in future works, including lectures and books,
3. the right to reproduce the article for own purposes, provided the copies are not offered for sale,
4. the right to self-archive the article.
