1992Unpublished venueRequires access

Neural algorithms of data performing in finite fields GF(2/sup m/)

V.A. Bogatov

Open publisher page 0 citations

Abstract

Neural networks realizing finite-field arithmetic are presented. The neural algorithms of addition and multiplication are exploited to develop a neural network realizing Zhegalkin's polynomial of the Boolean function. Neural algorithms for addition and exponentiation computation were used for solving linear equation systems and for evaluating logarithms in finite fields. The author presents the operations' run-time expressions in finite fields with neural networks and a comparative estimation of existing multiplication and exponentiation algorithms.>

About this research paper

What this paper is about

Neural networks realizing finite-field arithmetic are presented. The neural algorithms of addition and multiplication are exploited to develop a neural network realizing Zhegalkin's polynomial of the Boolean function. Neural algorithms for addition and exponentiation computation were used for solving linear equation systems and for evaluating logarithms in finite fields. The author presents the operations' run-time expressions in finite fields with neural networks and a comparative estimation of existing multiplication and exponentiation algorithms.>

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Neural networks realizing finite-field arithmetic are presented. The neural algorithms of addition and multiplication are exploited to develop a neural network realizing Zhegalkin's polynomial of the Boolean function. Neural algorithms for addition and exponentiation computation were used for solving linear equation systems and for evaluating logarithms in finite fields. The author presents the operations' run-time expressions in finite fields with neural networks and a comparative estimation of existing multiplication and exponentiation algorithms.>

Key concepts: Exponentiation, Finite field, Artificial neural network, Discrete logarithm, Computer science, Algorithm, Multiplication (music), Logarithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Neural algorithms of data performing in finite fields GF(2/sup m/) — Research Paper | ScholarLens