DocumentCode
562565
Title
Fundamental backgrounds of the discrete logarithms theory in the Rademacher-Krestenson´s basis
Author
Ivas´ev, Stepan ; Kasyanchuk, Mykhajlo ; Pazdriy, Ihor ; Trembach, Rostyslav ; Yakymenko, Ihor
Author_Institution
Ternopil Nat. Econ. Univ., Ternopil, Ukraine
fYear
2012
fDate
21-24 Feb. 2012
Firstpage
93
Lastpage
93
Abstract
In present study a method for constructing a table of indices, where the multiplication operation performed on short residues, which can reduce the time and computational complexity.
Keywords
computational complexity; cryptography; matrix multiplication; Rademacher-Krestenson basis; computational complexity; discrete logarithm theory; indices table; multiplication operation; time complexity; Complexity theory; Discrete logarithm; complexity; modular exhibition; modular multiplication;
fLanguage
English
Publisher
ieee
Conference_Titel
Modern Problems of Radio Engineering Telecommunications and Computer Science (TCSET), 2012 International Conference on
Conference_Location
Lviv-Slavske
Print_ISBN
978-1-4673-0283-8
Type
conf
Filename
6192807
Link To Document