CRYPTO SCHEMES BASED ON DIFFICULT DESCRETE LOGARITHM TASK

It is proposed algorithms and protocols, cracking of wich is required solving two hard computational tasks simultaneously: discrete logarithm task and factorization task. In compare of existing schemes, which could be cracked by solving one hard computational task, these schemes provide higher level of security, because of requirement of solving two hard computational tasks of different types simultaneously

Authors: I. A. Mondikova, M. A. Vaichikauskas

Direction: Informatics, management and Computer Technology

Keywords: Cryptographic protocols, hard task, discrete logarithm task, hard computational (mathematichal) task, factorization task

---

View full article