Loading…
Validation of Multipliers for Elements of Extended Galois Fields GF(pn) and Multipliers VHDL-descriptions Generator
This article discusses a VHDL-description (IPcore generator, IP - intellectual property) generator developed by the authors for multiplication of elements in extended Galois fields \mathrm{GF(p^{n}}). Such multipliers are used in information security systems based on elliptic curves. This generator...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 4 |
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Zholubak, Ivan Hlukhov, Valeriy |
description | This article discusses a VHDL-description (IPcore generator, IP - intellectual property) generator developed by the authors for multiplication of elements in extended Galois fields \mathrm{GF(p^{n}}). Such multipliers are used in information security systems based on elliptic curves. This generator simplifies the process of generating VHDL-descriptions for multipliers utilizing modified Guild cells that are interconnected. The count of modified Guild cells can reach 2^{999}. The evaluation of the generated multipliers' performance is presented for Galois fields: GF(3^{30}),GF(7^{17}),GF(23^{10}), and GF(53^{8}), which exhibit similar orders. The testing procedure involved simulations within the Active HDL environment, with the simulation outcomes being compared to the multiplication results obtained through the GaloisCPP C++ library. |
doi_str_mv | 10.1109/CSIT61576.2023.10324200 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_10324200</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10324200</ieee_id><sourcerecordid>10324200</sourcerecordid><originalsourceid>FETCH-LOGICAL-i119t-6a0089b169c73ff9763965ed32e68edc74e8e19a047259d19e2f65250eced4de3</originalsourceid><addsrcrecordid>eNpVkEFLAzEUhKMgWGr_gWCOetj6kuy-bI5Su22h4sHaa4mbtxBJd5dkBf33blEPnuYwMx_MMHYjYC4EmPvFy2aHotA4lyDVXICSuQQ4YzOjTakKUAg5ynM2kRoxU6jMJZul9A4wRiEHFBOW9jZ4Zwfftbxr-NNHGHwfPMXEmy7yZaAjtUM6ecvPgVpHjq9s6HzilafgEl9Vt317x23r_rX368dt5ijV0fcn-hiklqIdunjFLhobEs1-dcpeq-Vusc62z6vN4mGbeSHMkKEFKM2bQFNr1TRGjwOwIKckYUmu1jmVJIyFXMvCOGFINljIAqgmlztSU3b9w_VEdOijP9r4dfj7SX0DF8ddgQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Validation of Multipliers for Elements of Extended Galois Fields GF(pn) and Multipliers VHDL-descriptions Generator</title><source>IEEE Xplore All Conference Series</source><creator>Zholubak, Ivan ; Hlukhov, Valeriy</creator><creatorcontrib>Zholubak, Ivan ; Hlukhov, Valeriy</creatorcontrib><description>This article discusses a VHDL-description (IPcore generator, IP - intellectual property) generator developed by the authors for multiplication of elements in extended Galois fields \mathrm{GF(p^{n}}). Such multipliers are used in information security systems based on elliptic curves. This generator simplifies the process of generating VHDL-descriptions for multipliers utilizing modified Guild cells that are interconnected. The count of modified Guild cells can reach 2^{999}. The evaluation of the generated multipliers' performance is presented for Galois fields: GF(3^{30}),GF(7^{17}),GF(23^{10}), and GF(53^{8}), which exhibit similar orders. The testing procedure involved simulations within the Active HDL environment, with the simulation outcomes being compared to the multiplication results obtained through the GaloisCPP C++ library.</description><identifier>EISSN: 2766-3639</identifier><identifier>EISBN: 9798350360462</identifier><identifier>DOI: 10.1109/CSIT61576.2023.10324200</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer science ; Elliptic curves ; field characteristic ; GaloisCPP ; Generators ; Information security ; Intellectual property ; IP-core generator ; Libraries ; multiplier ; the order of the generating polynomial ; VHDL</subject><ispartof>2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT), 2023, p.1-4</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10324200$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27924,54554,54931</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10324200$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zholubak, Ivan</creatorcontrib><creatorcontrib>Hlukhov, Valeriy</creatorcontrib><title>Validation of Multipliers for Elements of Extended Galois Fields GF(pn) and Multipliers VHDL-descriptions Generator</title><title>2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)</title><addtitle>CSIT</addtitle><description>This article discusses a VHDL-description (IPcore generator, IP - intellectual property) generator developed by the authors for multiplication of elements in extended Galois fields \mathrm{GF(p^{n}}). Such multipliers are used in information security systems based on elliptic curves. This generator simplifies the process of generating VHDL-descriptions for multipliers utilizing modified Guild cells that are interconnected. The count of modified Guild cells can reach 2^{999}. The evaluation of the generated multipliers' performance is presented for Galois fields: GF(3^{30}),GF(7^{17}),GF(23^{10}), and GF(53^{8}), which exhibit similar orders. The testing procedure involved simulations within the Active HDL environment, with the simulation outcomes being compared to the multiplication results obtained through the GaloisCPP C++ library.</description><subject>Computer science</subject><subject>Elliptic curves</subject><subject>field characteristic</subject><subject>GaloisCPP</subject><subject>Generators</subject><subject>Information security</subject><subject>Intellectual property</subject><subject>IP-core generator</subject><subject>Libraries</subject><subject>multiplier</subject><subject>the order of the generating polynomial</subject><subject>VHDL</subject><issn>2766-3639</issn><isbn>9798350360462</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2023</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVkEFLAzEUhKMgWGr_gWCOetj6kuy-bI5Su22h4sHaa4mbtxBJd5dkBf33blEPnuYwMx_MMHYjYC4EmPvFy2aHotA4lyDVXICSuQQ4YzOjTakKUAg5ynM2kRoxU6jMJZul9A4wRiEHFBOW9jZ4Zwfftbxr-NNHGHwfPMXEmy7yZaAjtUM6ecvPgVpHjq9s6HzilafgEl9Vt317x23r_rX368dt5ijV0fcn-hiklqIdunjFLhobEs1-dcpeq-Vusc62z6vN4mGbeSHMkKEFKM2bQFNr1TRGjwOwIKckYUmu1jmVJIyFXMvCOGFINljIAqgmlztSU3b9w_VEdOijP9r4dfj7SX0DF8ddgQ</recordid><startdate>20231019</startdate><enddate>20231019</enddate><creator>Zholubak, Ivan</creator><creator>Hlukhov, Valeriy</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20231019</creationdate><title>Validation of Multipliers for Elements of Extended Galois Fields GF(pn) and Multipliers VHDL-descriptions Generator</title><author>Zholubak, Ivan ; Hlukhov, Valeriy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i119t-6a0089b169c73ff9763965ed32e68edc74e8e19a047259d19e2f65250eced4de3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer science</topic><topic>Elliptic curves</topic><topic>field characteristic</topic><topic>GaloisCPP</topic><topic>Generators</topic><topic>Information security</topic><topic>Intellectual property</topic><topic>IP-core generator</topic><topic>Libraries</topic><topic>multiplier</topic><topic>the order of the generating polynomial</topic><topic>VHDL</topic><toplevel>online_resources</toplevel><creatorcontrib>Zholubak, Ivan</creatorcontrib><creatorcontrib>Hlukhov, Valeriy</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zholubak, Ivan</au><au>Hlukhov, Valeriy</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Validation of Multipliers for Elements of Extended Galois Fields GF(pn) and Multipliers VHDL-descriptions Generator</atitle><btitle>2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)</btitle><stitle>CSIT</stitle><date>2023-10-19</date><risdate>2023</risdate><spage>1</spage><epage>4</epage><pages>1-4</pages><eissn>2766-3639</eissn><eisbn>9798350360462</eisbn><abstract>This article discusses a VHDL-description (IPcore generator, IP - intellectual property) generator developed by the authors for multiplication of elements in extended Galois fields \mathrm{GF(p^{n}}). Such multipliers are used in information security systems based on elliptic curves. This generator simplifies the process of generating VHDL-descriptions for multipliers utilizing modified Guild cells that are interconnected. The count of modified Guild cells can reach 2^{999}. The evaluation of the generated multipliers' performance is presented for Galois fields: GF(3^{30}),GF(7^{17}),GF(23^{10}), and GF(53^{8}), which exhibit similar orders. The testing procedure involved simulations within the Active HDL environment, with the simulation outcomes being compared to the multiplication results obtained through the GaloisCPP C++ library.</abstract><pub>IEEE</pub><doi>10.1109/CSIT61576.2023.10324200</doi><tpages>4</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | EISSN: 2766-3639 |
ispartof | 2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT), 2023, p.1-4 |
issn | 2766-3639 |
language | eng |
recordid | cdi_ieee_primary_10324200 |
source | IEEE Xplore All Conference Series |
subjects | Computer science Elliptic curves field characteristic GaloisCPP Generators Information security Intellectual property IP-core generator Libraries multiplier the order of the generating polynomial VHDL |
title | Validation of Multipliers for Elements of Extended Galois Fields GF(pn) and Multipliers VHDL-descriptions Generator |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T14%3A42%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Validation%20of%20Multipliers%20for%20Elements%20of%20Extended%20Galois%20Fields%20GF(pn)%20and%20Multipliers%20VHDL-descriptions%20Generator&rft.btitle=2023%20IEEE%2018th%20International%20Conference%20on%20Computer%20Science%20and%20Information%20Technologies%20(CSIT)&rft.au=Zholubak,%20Ivan&rft.date=2023-10-19&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.eissn=2766-3639&rft_id=info:doi/10.1109/CSIT61576.2023.10324200&rft.eisbn=9798350360462&rft_dat=%3Cieee_CHZPO%3E10324200%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i119t-6a0089b169c73ff9763965ed32e68edc74e8e19a047259d19e2f65250eced4de3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=10324200&rfr_iscdi=true |