The multiplication of elements of a finite field GF(2m) for combinational circuits
DOI:
https://doi.org/10.18372/2073-4751.3.7726Keywords:
конечные поля, комбинационные схемы, алгоритмы, сложность схемAbstract
Methods and algorithms of direct multiplication of elements of a finite field GF (2m) using logical functions. An approach to the construction of the combination-tional schemes devices implementing this method. Defined instrumental and temporal complexity of these schemes
References
Кубицкий В. И. Операции над многочленами в поле GF(2) / В. И. Кубицкий // Науч. вестн. ГосНИИ “Аэронавигация”. – 2007. – №7. – С. 185-194.
Пат. №25491 Украина, МПК G06F 7/49 (2007/01). Пристрiй для множення елементiв скiнченних полiв GF(2n) / Жуков И.А., Кубицкий В.И., Синельников А.А.; патентообладатель Нац. авиац. ун-т. - № u 2007 03644; заявл. 02.04.2007; опубл. 10.08.2007, Бюл. № 12.
Пат. №43629 Украина, МПК (2009) H03M 7/00. Пристрiй для множення елементiв скiнченних полiв GF(2n) / Жуков И.А., Кубицкий В.И., Синельников А.А.; патентообладатель Нац. авиац. ун-т. – № u 2009 02754; заявл. 25.03.2009; опубл. 25.08.2009, Бюл. № 16.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.




