Author:
Gao Shuhong,Von zur gathen Joachim,Panario Daniel,Shoup Victor
Subject
Computational Mathematics,Algebra and Number Theory
Reference47 articles.
1. Finding irreducible polynomials over finite fields;Adleman,1986
2. An implementation for a fast public key cryptosystem;Agnew;J. Cryptol.,1991
3. G. Agnew, R. Mullin, S. Vanstone, Advances in Cryptology—EUROCRYPT’88, Günther, C. G. 1988, Springer, Berlin, 251, 255
4. An implementation of elliptic curve cryptosystem over F 2155;Agnew;IEEE J. Selected Areas Commun.,1993
5. The Design and Analysis of Computer Algorithms;Aho,1974
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast Exponential Method on Galois Fields for Cryptographic Applications;2023 13th International Conference on Dependable Systems, Services and Technologies (DESSERT);2023-10-13
2. Squeezing Area of the Versatile GF (2
m
) GNB Arithmetic Operators;IEEE Transactions on Circuits and Systems I: Regular Papers;2023-06
3. Subquadratic-Time Algorithms for Normal Bases;computational complexity;2021-03-02
4. On finite field arithmetic in characteristic 2;Finite Fields and Their Applications;2020-12
5. Normal bases from 1-dimensional algebraic groups;Journal of Symbolic Computation;2020-11