https://oldena.lpnu.ua/handle/ntb/40457| Title: | Computing square roots and solve equations of ECC over galois fields |
| Authors: | Rahma, Mohammed Kadhim Hlukhov, Valeriy |
| Affiliation: | Lviv Polytechnic National University |
| Bibliographic description (Ukraine): | 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)). |
| Bibliographic description (International): | 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)). |
| Is part of: | Litteris et Artibus : матеріали, 2017 Litteris et Artibus : proceedings, 2017 |
| Conference/Event: | 7th International youth science forum «Litteris et Artibus» |
| Journal/Collection: | Litteris et Artibus : матеріали |
| Issue Date: | 23-Dec-2017 |
| Publisher: | Видавництво Львівської політехніки Lviv Polytechnic Publishing House |
| Place of the edition/event: | Львів Lviv |
| Temporal Coverage: | 23–25 листопада 2017 року 23–25 November, 2017 |
| Keywords: | Galois Fields Elliptical curve cryptography (ECC) square roots Computation the trace Computation square roots |
| Number of pages: | 4 |
| Page range: | 437-440 |
| Start page: | 437 |
| End page: | 440 |
| 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. |
| URI: | https://ena.lpnu.ua/handle/ntb/40457 |
| ISBN: | 978-966-941-108-2 |
| Copyright owner: | © Національний університет “Львівська політехніка”, 2017 |
| References (Ukraine): | [1] Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena, "Irreducibility and r-th root finding over finite fields," Cornell University , USA, 2017. [2] M. Repka, "Computing pth roots in extended finite fields of prime characteristic p ≥ 2," The Institution of Engineering and Technology, vol. 52, no. 9, p. 718 – 719, 2016. [3] Chang, Seunghwan; Kim, Bihtnara; Lee, Hyang- Sook, "POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS," Journal of the Korean Mathematical Society, vol. 52, no. 1, pp. pp.209-224, 2015. [4] Gora Adj and Francisco Rodrıguez-Henrıquez, "Square root computation over even extension fields," IEEE Transactions on Computers, vol. 63, no. 11, pp. 2829 – 2841, Nov 2014. [5] S. J. Aboud, "An Efficient Method for Finding Square Root," International Journal of Statistics, ISSN:2051-8285, vol. 37, no. 1, pp. 1103-1106, 2013. [6] PAULO S. L. M. BARRETO, JOSE FELIPE VOLOCH, Efficient Computation of Roots in Finite Fields, Netherlands: Kluwer Academic Publishers, 2004. [7] E. R. BERLEKAMP,H. RUMSEY, AND G. SOLOMON, "On the Solution of Algebraic Equations over Finite Fields," INFORMATION ANn CONTROL 1O, 553-564, Jet Propulsion Laboralory, Pasadena, California 91103,USA, June1967. [8] Darrel Hankerson, Alfred Menezes, Scott Vanstone, Guide to Elliptic Curve Cryptography, United States of America: ISBN 0-387-95273-X,2004. [9] K. H and P. Rosen, HANDBOOK OF DISCRETE MATHEMATICS and ITS APPLICATIONS, Boca Raton, FL 33487-2742: Taylor & Francis Group, LLC, 2013. |
| References (International): | [1] Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena, "Irreducibility and r-th root finding over finite fields," Cornell University , USA, 2017. [2] M. Repka, "Computing pth roots in extended finite fields of prime characteristic p ≥ 2," The Institution of Engineering and Technology, vol. 52, no. 9, p. 718 – 719, 2016. [3] Chang, Seunghwan; Kim, Bihtnara; Lee, Hyang- Sook, "POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS," Journal of the Korean Mathematical Society, vol. 52, no. 1, pp. pp.209-224, 2015. [4] Gora Adj and Francisco Rodrıguez-Henrıquez, "Square root computation over even extension fields," IEEE Transactions on Computers, vol. 63, no. 11, pp. 2829 – 2841, Nov 2014. [5] S. J. Aboud, "An Efficient Method for Finding Square Root," International Journal of Statistics, ISSN:2051-8285, vol. 37, no. 1, pp. 1103-1106, 2013. [6] PAULO S. L. M. BARRETO, JOSE FELIPE VOLOCH, Efficient Computation of Roots in Finite Fields, Netherlands: Kluwer Academic Publishers, 2004. [7] E. R. BERLEKAMP,H. RUMSEY, AND G. SOLOMON, "On the Solution of Algebraic Equations over Finite Fields," INFORMATION ANn CONTROL 1O, 553-564, Jet Propulsion Laboralory, Pasadena, California 91103,USA, June1967. [8] Darrel Hankerson, Alfred Menezes, Scott Vanstone, Guide to Elliptic Curve Cryptography, United States of America: ISBN 0-387-95273-X,2004. [9] K. H and P. Rosen, HANDBOOK OF DISCRETE MATHEMATICS and ITS APPLICATIONS, Boca Raton, FL 33487-2742: Taylor & Francis Group, LLC, 2013. |
| Content type: | Conference Abstract |
| Appears in Collections: | Litteris et Artibus. – 2017 р. |
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2017_Rahma_M_K-Computing_square_roots_437-440.pdf | 240.04 kB | Adobe PDF | View/Open | |
| 2017_Rahma_M_K-Computing_square_roots_437-440__COVER.png | 536.88 kB | image/png | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.