Factorization of polynomials over finite fields in subexponential time under GRH-Reference-Cited by-同舟云学术

Factorization of polynomials over finite fields in subexponential time under GRH

Published:1994 Issue: Volume: Page:209-219
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Evdokimov Sergei

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58691-1_58.pdf

Reference8 articles.

1. A.M. Adleman, H.W. Lenstra, Jr.: Finding irreducible polynomials over finite fields. Proc. 18th ACM Symp. on Theory of Computing (STOC) Berkeley (1986) 350–353

2. E.R. Berlekamp: Factoring polynomials over large finite fields. Math. Comp. 24 (1970) 713–735

3. S.A. Evdokimov: Factoring a solvable polynomial over a finite field and generalized Riemann hypothesis. Zapiski Nauchnych Seminarov LOMI 176 (1989) 104–117 (prepublication, 1986)

4. M.-D.A. Huang: Riemann hypothesis and finding roots over finite fields. Proc. 17th ACM Symp. on Theory of Computing (STOC) New-York (1985) 121–130

5. H.W. Lenstra, Jr.: Finding isomorphisms between finite fields. Math. Comp. 56 (1991) 329–347

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

1. Java Benchmark Performance of Homomorphic Polynomial Public Key Cryptography for Key Encapsulation and Digital Signature;2024 13th International Conference on Communications, Circuits and Systems (ICCCAS);2024-05-10

2. Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation;Quantum Information Processing;2023-08-18

3. Optimization of the multivariate polynomial public key for quantum safe digital signature;Scientific Reports;2023-04-19

4. A Generalised Successive Resultants Algorithm;Arithmetic of Finite Fields;2016

5. Deterministic root finding over finite fields using Graeffe transforms;Applicable Algebra in Engineering, Communication and Computing;2015-12-12