| DC Field | Value | Language |
|---|
| dc.contributor.author | Rahma, Mohammed Kadhim | |
| dc.contributor.author | Hlukhov, Valeriy | |
| dc.coverage.temporal | 23–25 листопада 2017 року | |
| dc.coverage.temporal | 23–25 November, 2017 | |
| dc.date.accessioned | 2018-04-12T13:06:02Z | - |
| dc.date.available | 2018-04-12T13:06:02Z | - |
| dc.date.created | 2017-12-23 | |
| dc.date.issued | 2017-12-23 | |
| dc.identifier.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)). | |
| dc.identifier.isbn | 978-966-941-108-2 | |
| dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/40457 | - |
| dc.description.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. | |
| dc.format.extent | 437-440 | |
| dc.language.iso | en | |
| dc.publisher | Видавництво Львівської політехніки | |
| dc.publisher | Lviv Polytechnic Publishing House | |
| dc.relation.ispartof | Litteris et Artibus : матеріали, 2017 | |
| dc.relation.ispartof | Litteris et Artibus : proceedings, 2017 | |
| dc.subject | Galois Fields | |
| dc.subject | Elliptical curve cryptography (ECC) | |
| dc.subject | square roots | |
| dc.subject | Computation the trace | |
| dc.subject | Computation square roots | |
| dc.title | Computing square roots and solve equations of ECC over galois fields | |
| dc.type | Conference Abstract | |
| dc.rights.holder | © Національний університет “Львівська політехніка”, 2017 | |
| dc.contributor.affiliation | Lviv Polytechnic National University | |
| dc.format.pages | 4 | |
| dc.identifier.citationen | 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)). | |
| dc.relation.references | [1] Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena, "Irreducibility and r-th root finding over finite fields," Cornell University , USA, 2017. | |
| dc.relation.references | [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. | |
| dc.relation.references | [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. | |
| dc.relation.references | [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. | |
| dc.relation.references | [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. | |
| dc.relation.references | [6] PAULO S. L. M. BARRETO, JOSE FELIPE VOLOCH, Efficient Computation of Roots in Finite Fields, Netherlands: Kluwer Academic Publishers, 2004. | |
| dc.relation.references | [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. | |
| dc.relation.references | [8] Darrel Hankerson, Alfred Menezes, Scott Vanstone, Guide to Elliptic Curve Cryptography, United States of America: ISBN 0-387-95273-X,2004. | |
| dc.relation.references | [9] K. H and P. Rosen, HANDBOOK OF DISCRETE MATHEMATICS and ITS APPLICATIONS, Boca Raton, FL 33487-2742: Taylor & Francis Group, LLC, 2013. | |
| dc.relation.referencesen | [1] Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena, "Irreducibility and r-th root finding over finite fields," Cornell University , USA, 2017. | |
| dc.relation.referencesen | [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. | |
| dc.relation.referencesen | [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. | |
| dc.relation.referencesen | [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. | |
| dc.relation.referencesen | [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. | |
| dc.relation.referencesen | [6] PAULO S. L. M. BARRETO, JOSE FELIPE VOLOCH, Efficient Computation of Roots in Finite Fields, Netherlands: Kluwer Academic Publishers, 2004. | |
| dc.relation.referencesen | [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. | |
| dc.relation.referencesen | [8] Darrel Hankerson, Alfred Menezes, Scott Vanstone, Guide to Elliptic Curve Cryptography, United States of America: ISBN 0-387-95273-X,2004. | |
| dc.relation.referencesen | [9] K. H and P. Rosen, HANDBOOK OF DISCRETE MATHEMATICS and ITS APPLICATIONS, Boca Raton, FL 33487-2742: Taylor & Francis Group, LLC, 2013. | |
| dc.citation.conference | 7th International youth science forum «Litteris et Artibus» | |
| dc.citation.journalTitle | Litteris et Artibus : матеріали | |
| dc.citation.spage | 437 | |
| dc.citation.epage | 440 | |
| dc.coverage.placename | Львів | |
| dc.coverage.placename | Lviv | |
| Appears in Collections: | Litteris et Artibus. – 2017 р.
|
