Low complexity normal bases-Reference-Cited by-同舟云学术

Low complexity normal bases

Author:

Ash David W.,Blake Ian F.,Vanstone Scott A.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference19 articles.

1. On the construction of low complexity normal bases;Ash,1986

2. Bit serial Reed-Solomon encoders;Berlekamp;IEEE Trans. Inform. Theory,1982

3. Primitive roots in a finite field;Carlitz;Trans. Amer. Math. Soc.,1952

4. A knapsack type public key cryptosystem;Chor,1984

5. Bases for finite fields;Davenport;J. Lond. Math. Soc.,1968

Cited by 111 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Squeezing Area of the Versatile GF (2^m) GNB Arithmetic Operators;IEEE Transactions on Circuits and Systems I: Regular Papers;2023-06

4. Performance Analysis of Gaussian Normal Basis GF ($2^{m}$) Serial Multipliers and Inverters;2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC);2021-01-27

5. Secure and Efficient Exponentiation Architectures Using Gaussian Normal Basis;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2021