Computing square roots and solve equations of ECC over galois fields
Date
2017-12-23
Journal Title
Journal ISSN
Volume Title
Publisher
Видавництво Львівської політехніки
Lviv Polytechnic Publishing House
Lviv Polytechnic Publishing House
Abstract
Computing square roots in finite fields are
important computational problems with significant
applications to cryptography. Therefore, in this paper, we
introduced some methods for finding square roots. Our
proposed method calculates the Square root using multiplier
over. The proposed method is competitive compared with other
existing methods. It is introduced development to decrease of
complexity of arithmetic units.
In addition, we approach a novel technique for Computation
square roots presented using Half_even_odd unit mixed with
multiplier and adder. One approach of Square Root
presented using the same multiplier for arithmetic units
of ECC. Thus, we goes to gets on reduced complexity for
arithmetic units.
Description
Keywords
Galois Fields, Elliptical curve cryptography (ECC), square roots, Computation the trace, Computation square roots
Citation
Rahma M. K. Computing square roots and solve equations of ECC over galois fields / Mohammed Kadhim Rahma, Valeriy Hlukhov // Litteris et Artibus : proceedings, 23–25 November, 2017. — Lviv : Lviv Polytechnic Publishing House, 2017. — P. 437–440. — (9th International academic conference «Computer science & engineering 2017» (CSE-2017)).