Finite field multiplier based on binary tree structure

A binary tree and finite field technology, applied in the field of finite field multipliers, can solve problems such as speed, area, and power consumption that cannot meet the requirements, and achieve obvious speed advantages, simple structure, and widely used effects

Inactive Publication Date: 2017-06-30
SHENZHEN POLYTECHNIC
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Various well-known finite-field multipliers that exist in the prior art, including software multipliers and hardware multipliers, all have deficiencies, such as performance indicators such as speed, area, and power consumption. Design specific devices to implement multiplication over finite fields

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Finite field multiplier based on binary tree structure
  • Finite field multiplier based on binary tree structure
  • Finite field multiplier based on binary tree structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The preferred embodiments of the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0025] Such as figure 1 with figure 2 As shown, this example provides a finite field multiplier based on a binary tree structure, including:

[0026] Input port for entering the finite field GF(2 n ) operand a(x) and operand b(x);

[0027] The output port is used to output the multiplication result c(x) of the operand a(x) and the operand b(x);

[0028] And, the binary tree structure, used to execute GF(2 of operand a(x) and operand b(x) n ) multiplication;

[0029] Among them, the binary tree structure includes n+1 layers, from top to bottom, the first layer to the nth layer includes a left binary tree and a right binary tree, and the bottom layer is the n+1th layer; each node of the n+1th layer is connected to Three specific nodes of the nth layer are connected.

[0030] In the left binary tree and the right binary tree ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a finite field multiplier based on a binary tree structure. The finite field multiplier comprises an input port used for inputting the operand a(x) and the operand b(x) of a finite field GF(2<n>), an output port used for outputting the multiplying result c(x) of the operand a(x) and the operand b(x), and a binary tree structure used for executing the multiplying of GF(2<n>) with the operand a(x) and the operand b(x). The binary tree structure comprises n+1 layers, from top to bottom, the layers numbered from 1 to n include a left binary tree and a right binary tree, and the bottommost layer is the (n+1)th layer; each node of the (n+1)th layer is connected with three nodes of the nth layer. Multiplying of the finite field is achieved with the binary tree structure, the structure is simple, and the finite field multiplier has obvious speed advantages in multiplying of GF(2<n>) compared with an existing finite field multiplier, and can be widely applied to various engineering fields.

Description

technical field [0001] The invention relates to a finite field multiplier, in particular to a finite field multiplier based on a binary tree structure. Background technique [0002] Finite fields, also known as Galois fields, are number fields containing finite elements, and are widely used in communication, security, storage and other fields; operations on finite fields are called finite field calculations, which roughly include finite field addition, Multiplication, inversion, division, etc. [0003] Among them, finite field multiplication is one of the most used and most complicated finite field calculations. Finite field multiplication is the basis of information security and communication fields, and plays an important role in cryptography and coding technology; the design method of finite field multiplication is generally based on algebraic methods, that is, using algebraic theory for multiplication operations, and using algebraic methods for multiplication operations...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F7/52
CPCG06F7/523
Inventor 易海博聂哲
Owner SHENZHEN POLYTECHNIC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap