Author:
Gashkov S. B.,Sergeev I. S.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference139 articles.
1. V. B. Afanassiev and A. A. Davydov, “Finite field tower: iterated presentation and complexity of arithmetic,” Finite Fields Appl., 8, 216–232 (2002).
2. G. B. Agnew, T. Beth, R. C. Mullin, and S. A. Vanstone, “Arithmetic operations in GF(2 m ),” J. Cryptol., 6, 3–13 (1993).
3. G. B. Agnew, R. C. Mullin, I. M. Onyszchuk, and S. A. Vanstone, “An implementation for a fast public-key cryptosystem,” J. Cryptol., 3, 63–79 (1991).
4. O. Ahmadi and A. Menezes, Irreducible Polynomials of Maximum Weight, Preprint (2005).
5. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading (1974).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pauli Flow on Open Graphs with Unknown Measurement Labels;Electronic Proceedings in Theoretical Computer Science;2024-08-12
2. Locally Recoverable Codes Over Z
p
s
;IEEE Transactions on Communications;2024-05
3. Compression points in elliptic Montgomery and Edwards curves;Proceedings of the 7th International Conference on Networking, Intelligent Systems and Security;2024-04-18
4. Storage Codes With Flexible Number of Nodes;IEEE Transactions on Information Theory;2023-01
5. One-Tape Turing Machine and Branching Program Lower Bounds for MCSP;Theory of Computing Systems;2022-12-27