# Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator

## Abstract

### MSC codes

### Keywords

## Get full access to this article

View all available purchase options and get full access to this article.

## References

*Inform. Process. Lett.*, 18 (1984), pp. 147–150.

*Appl. Sci. Res. B.*, 6 (1956), pp. 1–74.

*Time space tradeoffs (getting closer to the barrier?)*, in Proceedings of the 4th International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 762, Springer‐Verlag, London, 1993, pp. 209–220.

*Comput. Systems Sci.*, 8 (1974), pp. 366–386.

*J. Symbolic Comput.*, 24 (1997), pp. 235–265.

*Linear recurrences with polynomial coefficients and computation of the Cartier‐Manin operator on hyperelliptic curves*, in Proceedings of the International Conference on Finite Fields and Applications (Toulouse, 2003), Lecture Notes in Comput. Sci. 2948, Springer, Berlin, 2004, pp. 40–58.

*Tellegen’s principle into practice*, in Proceedings of the International Conference on Symbolic and Algebraic Computation, ACM Press, New York, 2003, pp. 37–44.

*Algebraic Complexity Theory*, Grundlehren der Math. Wiss. 315, Springer‐Verlag, Berlin, 1997.

*Acta Inform.*, 28 (1991), pp. 693–701.

*C. R. Acad. Sci. Paris*, 244 (1957), pp. 426–428.

*Approximations and complex multiplication according to Ramanujan*, in Ramanujan Revisited (Urbana‐Champaign, IL, 1987), Academic Press, Boston, MA, 1988, pp. 375–472.

*On the Minimum Computation Time of Functions*, Ph.D. thesis, Harvard University, Cambridge, MA, 1966.

*J. Symbolic Comput.*, 9 (1990), pp. 251–280.

*SIGSAM Bull.*, 31 (1997), pp. 36–47.

*Modern Computer Algebra*, Cambridge University Press, Cambridge, UK, 1999.

*Comput. Complexity*, 2 (1992), pp. 187–224.

*Experiment. Math.*, 12 (2003), pp. 395–402.

*Counting points on hyperelliptic curves over finite fields*, in Algorithmic Number Theory (ANTS‐IV), Lecture Notes in Comput. Sci. 1838, Springer, Berlin, 2000, pp. 313–332.

*Construction of secure random curves of genus 2 over prime fields*, in Advances in Cryptology (EUROCRYPT 2004), C. Cachin and J. Camenisch, eds., Lecture Notes in Comput. Sci. 3027, Springer, Berlin, 2004, pp. 239–256.

*Appl. Algebra Engrg. Comm. Comput.*, 14 (2004), pp. 415–438.

*p*über einem algebraischen Funktionenkörper der Charakteristik

*p*,

*Monatsch. Math. Phys.*, 43 (1936), pp. 477–492.

*Inform. Process. Lett.*, 1 (1972), pp. 157–163.

*J. Symbolic Comput.*, 29 (2000), pp. 891–919.

*J. Ramanujan Math. Soc.*, 16 (2001), pp. 323–338.

*The analysis of algorithms*, in Actes du Congrès International des Mathématiciens (Nice, 1970), Tome 3, Gauthier‐Villars, Paris, 1971, pp. 269–274.

*The number field sieve*, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 564–572.

*J. Amer. Math. Soc.*, 5 (1992), pp. 483–516.

*Trans. Amer. Math. Soc.*, 45 (1965), pp. 245–264.

*An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields*, in Algorithmic Number Theory (ANTS‐V), Lecture Notes in Comput. Sci. 2369, Springer, Berlin, 2002, pp. 461–474.

*Old and new deterministic factoring algorithms*, in Algorithmic Number Theory (Talence, 1996), Lecture Notes in Comput. Sci. 1122, Springer, Berlin, 1996, pp. 217–224.

*Fast modular transforms via division*, in Proceedings of the Thirteenth Annual IEEE Symposium on Switching and Automata Theory (University of Maryland, College Park, MD), 1972, pp. 90–96.

*Math. Comp.*, 48 (1987), pp. 243–264.

*An FFT Extension of the Elliptic Curve Method of Factorization*, Ph.D. thesis, University of California, Los Angeles CA, 1992.

*Math. Comp.*, 55 (1990), pp. 745–763.

*Proc. Cambridge Philos. Soc.*, 76 (1974), pp. 521–528.

*Analysis and comparison of some integer factoring algorithms*, in Computational Methods in Number Theory, Part I, Math. Centre Tracts 154, Math. Centrum, Amsterdam, 1982, pp. 89–139.

*J. Ramanujan Math. Soc.*, 15 (2000), pp. 247–270.

*Acta Inform.*, 1 (1971), pp. 139–144.

*Acta Inform.*, 7 (1977), pp. 395–398.

*Fast Algorithms*, Bibliographisches Institut, Mannheim, 1994.

*Computing*, 7 (1971), pp. 281–292.

*NTL: A library for doing number theory*. http://www.shoup.net/ntl (2005).

*A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic*, in Proceedings of the International Conference on Symbolic and Algebraic Computation, ACM Press, New York, 1991, pp. 14–21.

*The Arithmetic of Elliptic Curves*, Graduate Texts in Math. 106, Springer‐Verlag, New York, 1996.

*Experiment. Math.*, 8 (1999), pp. 119–133.

*Numer. Math.*, 13 (1969), pp. 354–356.

*Numer. Math.*, 20 (1972/73), pp. 238–251.

*Jber. Deutsch. Math.‐Verein.*, 78 (1976/77), pp. 1–8.

*Philips Res. Rep.*, 7 (1952), pp. 259–269.

*J. Algebra*, 52 (1978), pp. 378–410.

## Information & Authors

### Information

#### Published In

#### Copyright

#### History

**Submitted**: 17 May 2004

**Accepted**: 14 September 2006

**Published online**: 22 March 2007

#### MSC codes

#### Keywords

### Authors

## Metrics & Citations

### Metrics

### Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

#### Cited By

- Deterministic factoring with oraclesApplicable Algebra in Engineering, Communication and Computing, Vol. 34, No. 4 | 16 September 2021
- Fast computation of the N-th term of a q-holonomic sequence and applicationsJournal of Symbolic Computation, Vol. 115 | 1 Mar 2023
- Counting points on smooth plane quarticsResearch in Number Theory, Vol. 9, No. 1 | 21 November 2022
- Background and Fundamental ConceptsD-Finite Functions | 22 May 2023
- The Recurrence Case in One VariableD-Finite Functions | 22 May 2023
- The Differential Case in One VariableD-Finite Functions | 22 May 2023
- OperatorsD-Finite Functions | 22 May 2023
- Summation and IntegrationD-Finite Functions | 22 May 2023
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)Journal of the ACM, Vol. 69, No. 2 | 30 Apr 2022
- A log-log speedup for exponent one-fifth deterministic integer factorisationMathematics of Computation, Vol. 36 | 15 December 2021
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fieldsJournal of Symbolic Computation, Vol. 105 | 1 Jul 2021
- Improved algorithms for left factorial residuesInformation Processing Letters, Vol. 167 | 1 Apr 2021
- Computing the N-th term of a q-holonomic sequenceProceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 27 July 2020
- A Reduction of Integer Factorization to Modular TetrationInternational Journal of Foundations of Computer Science, Vol. 31, No. 04 | 6 July 2020
- Fast multivariate multi-point evaluation revisitedJournal of Complexity, Vol. 56 | 1 Feb 2020
- Counting points on superelliptic curves in average polynomial timeOpen Book Series, Vol. 4, No. 1 | 29 December 2020
- Faster polynomial multiplication over finite fields using cyclotomic coefficient ringsJournal of Complexity, Vol. 54 | 1 Oct 2019
- Computing Hypergeometric Functions RigorouslyACM Transactions on Mathematical Software, Vol. 45, No. 3 | 8 August 2019
- Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld ModuleProceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 8 July 2019
- Cryptanalysis of Server-Aided RSA Protocols with Private-Key SplittingThe Computer Journal, Vol. 261 | 13 May 2019
- Fast coefficient computation for algebraic power series in positive characteristicThe Open Book Series, Vol. 2, No. 1 | 28 January 2019
- Faster integer multiplication using short lattice vectorsThe Open Book Series, Vol. 2, No. 1 | 28 January 2019
- Computing zeta functions of cyclic covers in large characteristicThe Open Book Series, Vol. 2, No. 1 | 28 January 2019
- Explicit Coleman integration in larger characteristicThe Open Book Series, Vol. 2, No. 1 | 28 January 2019
- On the complexity of integer matrix multiplicationJournal of Symbolic Computation, Vol. 89 | 1 Nov 2018
- A Deterministic Algorithm for Computing Divisors in an IntervalInformation Security and Privacy | 13 June 2018
- Faster Polynomial Multiplication over Finite FieldsJournal of the ACM, Vol. 63, No. 6 | 20 January 2017
- Even faster integer multiplicationJournal of Complexity, Vol. 36 | 1 Oct 2016
- A linear-time algorithm for the orbit problem over cyclic groupsActa Informatica, Vol. 53, No. 5 | 19 November 2015
- Computation of the Similarity Class of the p-CurvatureProceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 20 July 2016
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime FieldProceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 20 July 2016
- Deterministic root finding over finite fields using Graeffe transformsApplicable Algebra in Engineering, Communication and Computing, Vol. 27, No. 3 | 12 December 2015
- Computing -series of geometrically hyperelliptic curves of genus threeLMS Journal of Computation and Mathematics, Vol. 19, No. A | 26 August 2016
- Computing zeta functions of arithmetic schemesProceedings of the London Mathematical Society, Vol. 111, No. 6 | 29 November 2015
- A search for Wilson primesMathematics of Computation, Vol. 83, No. 290 | 27 January 2014
- Variation of Néron–Severi Ranks of Reductions of K3 SurfacesExperimental Mathematics, Vol. 23, No. 4 | 14 November 2014
- Counting points on hyperelliptic curves in average polynomial timeAnnals of Mathematics, Vol. 179, No. 2 | 1 March 2014
- Difference integrability conditions for parameterized linear difference and differential equationsAdvances in Applied Mathematics, Vol. 53 | 1 Feb 2014
- Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial timeLMS Journal of Computation and Mathematics, Vol. 17, No. A | 1 August 2014
- Time/Memory/Data Tradeoffs for Variants of the RSA ProblemComputing and Combinatorics | 1 Jan 2013
- Computing zeta functions of nondegenerate hypersurfaces with few monomialsLMS Journal of Computation and Mathematics, Vol. 16 | 14 February 2013
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the IntegersAdvances in Cryptology – EUROCRYPT 2012 | 1 Jan 2012
- Kedlaya's Algorithm in Larger CharacteristicInternational Mathematics Research Notices, Vol. 36 | 8 July 2010
- Computing Zeta Functions of Superelliptic Curves in Larger CharacteristicMathematics in Computer Science, Vol. 3, No. 2 | 19 December 2009
- Improvements in the computation of the Hasse-Witt matrixJSIAM Letters, Vol. 2, No. 0 | 1 Jan 2010
- Factoring pq 2 with Quadratic Forms: Nice CryptanalysesAdvances in Cryptology – ASIACRYPT 2009 | 1 Jan 2009

## View Options

### Get Access

**Access via your Institution**- Questions about how to access this content? Contact SIAM at
**[email protected]**.