Matters Computational: Ideas, Algorithms, Source Code

This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems.

[1]  Mikhail J. Atallah,et al.  Watermarking with quadratic residues , 1999, Electronic Imaging.

[2]  Tadao Takaoka,et al.  Combinatorial Generation by Fusing Loopless Algorithms , 2006, CATS.

[3]  Donald E. Knuth,et al.  Structured Programming with go to Statements , 1974, CSUR.

[4]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .

[5]  Joe Sawada,et al.  Generating Bracelets in Constant Amortized Time , 2001, SIAM J. Comput..

[6]  Mark B. Wells.  Generation of permutations by transposition , 1961 .

[7]  Jesús Guillera,et al.  Easy Proofs of Some Borwein Algorithms for π , 2008, Am. Math. Mon..

[8]  Stephen D. Cohen.  The explicit construction of irreducible polynomials over finite fields , 1992, Des. Codes Cryptogr..

[9]  Kenji Koike,et al.  Isogeny formulas for the Picard modular form and a three terms arithmetic geometric mean , 2007 .

[10]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[11]  Witold Lipski.  More on permutation generation methods , 2005, Computing.

[12]  S. Sattolo.  An Algorithm to Generate a Random Cyclic Permutation , 1986, Inf. Process. Lett..

[13]  Ricardo Dahab,et al.  Multiplication using Normal Bases , 2004 .

[14]  H. Lenstra,et al.  Primitive normal bases for finite fields , 1987 .

[15]  David H. Bailey,et al.  The Fractional Fourier Transform and Applications , 1991, SIAM Rev..

[16]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[17]  Jean-Michel Muller,et al.  BKM: A new hardware algorithm for complex elementary functions , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[18]  Th. Clausen,et al.  Beitrag zur Theorie der Reihen. , 1828 .

[19]  J. Solinas.  CORR 99-39 Generalized Mersenne Numbers , 1999 .

[20]  Ronald Joseph Burthe.  Further investigations with the strong probable prime test , 1996, Math. Comput..

[21]  Marco Bodrato,et al.  Integer and polynomial multiplication: towards optimal toom-cook matrices , 2007, ISSAC '07.

[22]  Yasuyuki Nogami,et al.  Generating prime degree irreducible polynomials by using irreducible all‐one polynomial over F2 , 2005 .

[23]  Selmer M. Johnson.  Generation of permutations by adjacent transposition , 1963 .

[24]  Frank Ruskey,et al.  An explicit universal cycle for the (n-1)-permutations of an n-set , 2007, TALG.

[25]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[26]  Michael Ben-Or,et al.  Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[27]  David G. Cantor,et al.  On arithmetical algorithms over finite fields , 1989, Journal of combinatorial theory. Series A.

[28]  Richard P. Brent.  Fast Algorithms for High-Precision Computation of Elementary Functions , 2006 .

[29]  Christophe Doche,et al.  Redundant Trinomials for Finite Fields of Characteristic 2 , 2005, ACISP.

[30]  Ralf Stephan.  Divide-and-conquer generating functions. Part I. Elementary sequences , 2003 .

[31]  Fabrice Bellard Jan.  Computation of 2700 billion decimal digits of Pi using a Desktop Computer , 2010 .

[32]  Fan Chung Graham,et al.  Universal cycles for combinatorial structures , 1992, Discret. Math..

[33]  J. Arndt,et al.  Testing polynomial irreducibility without GCDs , 2008 .

[34]  Frank Ruskey,et al.  An efficient algorithm for generating necklaces with fixed density , 1999, SODA '99.

[35]  Steven R. Finch,et al.  Mathematical constants , 2005, Encyclopedia of mathematics and its applications.

[36]  Helmut Prodinger,et al.  Generating Random Derangements , 2008, ANALCO.

[37]  Jorg Arndt,et al.  Generating Random Permutations , 2010 .

[38]  Abraham A. Ungar.  Generalized Hyperbolic Functions , 1982 .

[39]  Andreas Björklund,et al.  Fourier meets möbius: fast subset convolution , 2006, STOC '07.

[40]  Michael T. Orchard.  Fast bit-reversal algorithms based on index representations in GF (2b) , 1992, IEEE Trans. Signal Process..

[41]  D. Kalman.  A Singularly Valuable Decomposition: The SVD of a Matrix , 1996 .

[42]  M. Victor Wickerhauser,et al.  Adapted wavelet analysis from theory to software , 1994 .

[43]  Frank Ruskey,et al.  Generating Necklaces , 1992, J. Algorithms.

[44]  Dominique Roelants van Baronaigien.  A Loopless Gray-Code Algorithm for Listing k-ary Trees , 2000, J. Algorithms.

[45]  Helmut Meyn,et al.  Self-reciprocal polynomials over finite fields. , 1989 .

[46]  Gideon Ehrlich,et al.  Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.

[47]  Frank Ruskey,et al.  Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) , 2000, J. Algorithms.

[48]  D. H. Lehmer,et al.  New primality criteria and factorizations of 2^{}±1 , 1975 .

[49]  Harald Niederreiter,et al.  Finite fields and their applications , 1996 .

[50]  Shujian Zhang,et al.  Minimal cost one-dimensional linear hybrid cellular automata of degree through 500 , 1995, J. Electron. Test..

[51]  Richard P. Brent,et al.  On computing factors of cyclotomic polynomials , 1993, ArXiv.

[52]  Victor Shoup,et al.  A computational introduction to number theory and algebra , 2005 .

[53]  M. Anwar Hasan,et al.  Asymmetric Squaring Formulae , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).

[54]  Arnold Schönhage,et al.  Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2 , 1977, Acta Informatica.

[55]  Bruce C. Berndt,et al.  Flowers which we cannot yet see growing in Ramanujan's garden of hypergeometric series, elliptic functions, and q's , 2001 .

[56]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[57]  F. M. Ives.  Permutation enumeration: four new permutation algorithms , 1976, CACM.

[58]  Peter L. Montgomery,et al.  Division by invariant integers using multiplication , 1994, PLDI '94.

[59]  I. Damgård,et al.  Average case error estimates for the strong probable prime test , 1993 .

[60]  B. Fagin,et al.  Discrete weighted transforms and large-integer arithmetic , 1994 .

[61]  Richard P. Brent,et al.  A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 , 2003, Math. Comput..

[62]  David R. Musser,et al.  Introspective Sorting and Selection Algorithms , 1997, Softw. Pract. Exp..

[63]  Damien Stehlé,et al.  A Binary Recursive Gcd Algorithm , 2004, ANTS.

[64]  Timothy Walsh,et al.  Generating Gray Codes in O(1) Worst-Case Time per Word , 2003, DMTCS.

[65]  Joe Sawada,et al.  A fast algorithm to generate necklaces with fixed content , 2003, Theor. Comput. Sci..

[66]  Donald E. Knuth.  Efficient representation of perm groups , 1991, Comb..

[67]  Robert W. Doran,et al.  The Gray Code , 2007, J. Univers. Comput. Sci..

[68]  Richard P. Brent,et al.  Computing Aurifeuillian Factors , 1995 .

[69]  Antoine Joux,et al.  Collisions of SHA-0 and Reduced SHA-1 , 2005, EUROCRYPT.

[70]  Helmut Prodinger.  On binary representations of integers with digits . , 2000 .

[71]  G. Rota.  On the Foundations of Combinatorial Theory , 2009 .

[72]  Richard P. Brent,et al.  On the periods of generalized Fibonacci recurrences , 1994, ArXiv.

[73]  Richard P. Brent,et al.  A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers , 1996, ANTS.

[74]  Frank Ruskey,et al.  Generating Combinations by Prefix Shifts , 2005, COCOON.

[75]  Kostas Karamanos,et al.  From Symbolic Dynamics to a Digital Approach , 2001, Int. J. Bifurc. Chaos.

[76]  Joachim von zur Gathen,et al.  Computing Frobenius maps and factoring polynomials , 2005, computational complexity.

[77]  Kazuo Ushijima,et al.  On O(1) Time Algorithms for Combinatorial Generation , 2001, Comput. J..

[78]  Alfred Menezes,et al.  On the Number of Trace-One Elements in Polynomial Bases for $$\mathbb{F}_{2^n}$$ , 2005, Des. Codes Cryptogr..

[79]  Henri Cohen,et al.  Convergence Acceleration of Alternating Series , 2000, Exp. Math..

[80]  Janusz Rajski,et al.  Primitive Polynomials Over GF(2) of Degree up to 660 with Uniformly Distributed Coefficients , 2003, J. Electron. Test..

[81]  Marco Bodrato,et al.  What About Toom-Cook Matrices Optimality ? , 2006 .

[82]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[83]  Andrew V. Sills,et al.  On identities of the Rogers-Ramanujan type , 2006, 1811.11285.

[84]  Carla D. Savage,et al.  Gray Code Enumeration of Families of Integer Partitions , 1995, J. Comb. Theory, Ser. A.

[85]  Andrew D. King.  Generating indecomposable permutations , 2006, Discret. Math..

[86]  Arnaud Bodin,et al.  Number of Irreducible Polynomials in Several Variables over Finite Fields , 2007, Am. Math. Mon..

[87]  Mit Press,et al.  A Linear Filtering Approach to the Computation of the Discrete Fourier Transform , 1969 .

[88]  K. Zietak,et al.  The polar decomposition— properties, applications and algorithms , 1995 .

[89]  Wolfram Koepf.  Orthogonal Polynomials and Computer Algebra , 1999 .

[90]  Shuhong Gao.  Normal Bases over Finite Fields , 1993 .

[91]  Yves Gallot.  CYCLOTOMIC POLYNOMIALS AND PRIME NUMBERS , 2001 .

[92]  F. Arnault.  Rabin-Miller primality test: composite numbers which pass it , 1995 .

[93]  H. Nussbaumer.  Fast Fourier transform and convolution algorithms , 1981 .

[94]  Mark Goresky,et al.  Feedback shift registers, 2-adic span, and combiners with memory , 1997, Journal of Cryptology.

[95]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[96]  Aaron Williams,et al.  Loopless generation of multiset permutations using a constant number of variables by prefix shifts , 2009, SODA.

[97]  David H. Bailey,et al.  On the Random Character of Fundamental Constant Expansions , 2001, Exp. Math..

[98]  Richard P. Brent,et al.  Faster Multiplication in GF(2)[x] , 2008, ANTS.

[99]  A. Householder.  The numerical treatment of a single nonlinear equation , 1970 .

[100]  Robert S. Maier.  On Rationally Parametrized Modular Equations , 2006 .

[101]  F. J. W. Whipple.  A Fundamental Relation between Generalized Hypergeometric Series , 1926 .

[102]  Glenn H. Hurlbert,et al.  On the de Bruijn Torus Problem , 1993, J. Comb. Theory, Ser. A.

[103]  Ernst Joachim Weniger,et al.  Nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series , 1989 .

[104]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[105]  Ramanujachary Kumanduri,et al.  Number theory with computer applications , 1997 .

[106]  G. Jaeschke.  On strong pseudoprimes to several bases , 1993 .

[107]  R. Hartley.  A More Symmetrical Fourier Analysis Applied to Transmission Problems , 1942, Proceedings of the IRE.

[108]  William L. Briggs,et al.  Bluestein's FFT for arbitrary N on the hypercube , 1991, Parallel Comput..

[109]  Warren P. Johnson.  How Cauchy Missed Ramanujan's 1ψ1 Summation , 2004, Am. Math. Mon..

[110]  Ya Yan Lu,et al.  Computing the logarithm of a symmetric positive definite matrix , 1998 .

[111]  Frank Ruskey,et al.  An Eades-McKay Algorithm for Well-Formed Parentheses Strings , 1998, Information Processing Letters.

[112]  Robert S. Maier.  Algebraic hypergeometric transformations of modular origin , 2005 .

[113]  Mark C. Wilson.  Random and Exhaustive Generation of Permutations and Cycles , 2007, math/0702753.

[114]  Andrew V. Sills,et al.  Finite Rogers-Ramanujan Type Identities , 2003, Electron. J. Comb..

[115]  P. Zimmermann,et al.  High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams , 2004, 2105.06013.

[116]  Ivan Damgård,et al.  An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates , 2003, FCT.

[117]  D. H. Lehmer.  Interesting Series Involving the Central Binomial Coefficient , 1985 .

[118]  Robert Sedgewick,et al.  Permutation Generation Methods , 1977, CSUR.

[119]  T. W. Chaundy.  ON CLAUSEN'S HYPERGEOMETRIC IDENTITY , 1958 .

[120]  Xxxxx,et al.  Generating Balanced Parentheses and Binary Trees by Prefix Shifts , 2007 .

[121]  Douglas L. Jones,et al.  Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..

[122]  Frank Ruskey,et al.  Ranking and unranking permutations in linear time , 2001, Inf. Process. Lett..

[123]  Zhenxiang Zhang.  Finding strong pseudoprimes to several bases , 2001, Math. Comput..

[124]  Lucy Joan Slater,et al.  Further Identities of the Rogers‐Ramanujan Type , 1952 .

[125]  K. R. McLean.  Divisibility Properties of Binomial Coefficients , 1974 .

[126]  Brendan D. McKay,et al.  An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property , 1984, Inf. Process. Lett..

[127]  Victor Shoup,et al.  A New Polynomial Factorization Algorithm and its Implementation , 1995, J. Symb. Comput..

[128]  J. Cooley,et al.  New algorithms for digital convolution , 1977 .

[129]  Andrew Granville,et al.  It is easy to determine whether a given integer is prime , 2004 .

[130]  C. Pomerance,et al.  Prime Numbers: A Computational Perspective , 2002 .

[131]  H. Belbachir,et al.  LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX , 2006 .

[132]  John Todd,et al.  A Problem on arc Tangent Relations , 1949 .

[133]  Abraham Lempel,et al.  Self-Complementary Normal Bases in Finite Fields , 1988, SIAM J. Discret. Math..

[134]  Igor Pak,et al.  Partition bijections, a survey , 2006 .

[135]  Daniel Loebenberger,et al.  A Simple Derivation for the Frobenius Pseudoprime Test , 2008, IACR Cryptol. ePrint Arch..

[136]  Marco Bodrato,et al.  Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0 , 2007, WAIFI.

[137]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[138]  J. Traub.  Iterative Methods for the Solution of Equations , 1982 .

[139]  Nicholas J. Higham,et al.  Stable iterations for the matrix square root , 1997, Numerical Algorithms.

[140]  Jeffrey Shallit,et al.  The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[141]  W. N. Bailey.  Products of Generalized Hypergeometric Series , 1928 .

[142]  A. Erdélyi,et al.  Higher Transcendental Functions , 1954 .

[143]  Frank Ruskey,et al.  Generating Necklaces and Strings with Forbidden Substrings , 2000, COCOON.

[144]  A. Menezes,et al.  IRREDUCIBLE POLYNOMIALS OF MAXIMUM WEIGHT , 2005 .

[145]  Richard P. Stanley.  EXERCISES ON CATALAN AND RELATED NUMBERS , 1999 .

[146]  Timothy Walsh,et al.  A loop-free two-close Gray-code algorithm for listing k-ary Dyck words , 2006, J. Discrete Algorithms.

[147]  Dieter Gollmann,et al.  Self-dual bases in $$\mathbb{F}_{q^n } $$ , 1993, Des. Codes Cryptogr..

[148]  Henk D. L. Hollmann,et al.  Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[149]  Eli Biham,et al.  Near-Collisions of SHA-0 , 2004, CRYPTO.

[150]  N. Higham.  The matrix sign decomposition and its relation to the polar decomposition , 1994 .

[151]  Douglas R. Stinson,et al.  Minimality and other properties of the width-w nonadjacent form , 2005, Math. Comput..

[152]  Jacques Dutka,et al.  On square roots and their representations , 1986 .

[153]  Larry J. Stockmeyer,et al.  On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..

[154]  Patrick Solé,et al.  Quadratic iterations to associated with elliptic functions to the cubic and septic base , 2002 .

[155]  Qi Sun,et al.  Normal Bases and Their Dual–Bases over Finite Fields , 2006 .

[156]  Frank G. Garvan.  Ramanujan's Theories of Elliptic Functions to Alternative Bases-a Symbolic Excursion , 1995, J. Symb. Comput..

[157]  Frank G. Garvan.  CUBIC MODULAR IDENTITIES OF RAMANUJAN, HYPERGEOMETRIC FUNCTIONS AND ANALOGUES OF THE ARITHMETIC-GEOMETRIC MEAN ITERATION , 1993 .

[158]  Jean-Paul Allouche,et al.  The Komornik-Loreti Constant is Transcendental , 2000, Am. Math. Mon..

[159]  Carl Pomerance,et al.  The pseudoprimes to 25⋅10⁹ , 1980 .

[160]  J. Gordon.  Very simple method to find the minimum polynomial of an arbitrary nonzero element of a finite field , 1976 .

[161]  Shuhong Gao,et al.  Tests and constructions of irreducible polynomials over finite fields , 1997 .

[162]  Robert S. Maier.  P-symbols, Heun Identities, and 3F2 Identities , 2007, 0712.4299.

[163]  Scott A. Vanstone,et al.  On the number of self-dual bases of ${\rm GF}(q\sp m)$ over ${\rm GF}(q)$ , 1990 .

[164]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[165]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[166]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[167]  Harald Niederreiter,et al.  An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field , 1990, Applicable Algebra in Engineering, Communication and Computing.

[168]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[169]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[170]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[171]  Neil Immerman,et al.  The Similarities (and Differances) between Polynomials and Integers , 1992 .

[172]  W. N. Bailey,et al.  Generalized hypergeometric series , 1935 .

[173]  David M. Smith,et al.  Efficient multiple-precision evaluation of elementary functions , 1989 .

[174]  Alston S. Householder,et al.  Polynomial iterations to roots of algebraic equations , 1951 .

[175]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[176]  Roberto Maria Avanzi,et al.  Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic , 2007, Selected Areas in Cryptography.

[177]  Vincent Vajnovszki,et al.  Gray codes for necklaces and Lyndon words of arbitrary base , 2006 .

[178]  Bahman Kalantari,et al.  On Extraneous Fixed-Points of the Basic Family of Iteration Functions , 2003 .

[179]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

[180]  Geoffrey Dixon.  Division Algebras, Galois Fields, Quadratic Residues , 1993 .

[181]  Howard Cheng,et al.  Time-and space-efficient evaluation of some hypergeometric constants , 2007, ISSAC '07.

[182]  Carla D. Savage.  Generating Permutations with k-Differences , 1990, SIAM J. Discret. Math..

[183]  Marcel Waldvogel,et al.  Fast incremental CRC updates for IP over ATM networks , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[184]  David H. Bailey,et al.  FFTs in external or hierarchical memory , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[185]  Bruno Haible,et al.  Fast Multiprecision Evaluation of Series of Rational Numbers , 1998, ANTS.

[186]  Adalbert Kerber.  A matrix of combinatorial numbers related to the symmetric groups , 1978, Discret. Math..

[187]  P. L. Montgomery,et al.  A survey of modern integer factorization algorithms , 1994 .

[188]  T. Howell,et al.  The Complexity of the Quaternion Product , 1975 .

[189]  R. Kaye.  A Gray Code for Set Partitions , 1976, Inf. Process. Lett..

[190]  Jaakko Astola,et al.  Discrete orthogonal transforms based on Fibonacci-type recursions , 1996, 1996 IEEE Digital Signal Processing Workshop Proceedings.

[191]  H. Hahn.  Theorie und Anwendung der unendlichen Reihen , 1932 .

[193]  C. Loan.  Computational Frameworks for the Fast Fourier Transform , 1992 .

[194]  Pedro Berrizbeitia,et al.  Generalized Strong Pseudoprime Tests and Applications , 2000, J. Symb. Comput..

[195]  Shmuel Zaks,et al.  A new algorithm for generation of permutations , 1984, BIT.

[196]  Clement W. H. Lam,et al.  Three new combination algorithms with the minimal change property , 1982, CACM.

[197]  E. Salamin,et al.  Computation of π Using Arithmetic-Geometric Mean , 1976 .

[198]  Christof Paar,et al.  Generalizations of the Karatsuba Algorithm for Efficient Implementations , 2006, IACR Cryptol. ePrint Arch..

[199]  David M. Bressoud,et al.  A Generalization of the Rogers-Ramanujan Identities for all Moduli , 1979, J. Comb. Theory, Ser. A.

[200]  Otmar Scherzer,et al.  The Construction of Orthonormal Wavelets Using Symbolic Methods and a Matrix Analytical Approach for Wavelets on the Interval , 2001, Exp. Math..

[201]  S. Cook,et al.  ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .

[202]  Zhong-De Wang,et al.  New Algorithm for the Slant Transform , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[203]  Reiner Creutzburg,et al.  Parameter determination for complex number-theoretic transforms using cyclotomic polynomials , 1989 .

[204]  R. D. Carmichael,et al.  History of the Theory of Numbers, Volume I: Divisibility and Primality , 2012 .

[205]  Douglas W. Clark,et al.  Maximal and Near-Maximal Shift Register Seqyences: Efficient Event Counters and Easy Discrete Logarithms , 1994, IEEE Trans. Computers.

[206]  I. Blake,et al.  Construction and Distribution Problems for Irreducible Trinomials over Finite Fields , 1996 .

[207]  Heng Huat Chan.  On Ramanujan's cubic transformation formula for 2 F 1 (1/3, 2/3; 1; z) , 1998 .

[208]  Mark Goresky,et al.  Fibonacci and Galois representations of feedback-with-carry shift registers , 2002, IEEE Trans. Inf. Theory.

[209]  Richard P. Brent,et al.  A Multi-level Blocking Distinct Degree Factorization Algorithm , 2007, ArXiv.

[210]  Solomon W. Golomb.  CYCLOTOMIC POLYNOMIALS AND FACTORIZATION THEOREMS , 1978 .

[211]  Richard E. Crandall,et al.  The twenty-fourth Fermat number is composite , 2003, Math. Comput..

[212]  Dengguo Feng,et al.  Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD , 2004, IACR Cryptol. ePrint Arch..

[213]  Glen G. Langdon.  An algorithm for generating permutations , 1967, CACM.

[214]  K. H. Randall,et al.  Using de Bruijn Sequences to Index a 1 in a Computer Word , 1998 .

[215]  E. Netto,et al.  Lehrbuch der Combinatorik , 1902 .

[216]  E. Vrscay,et al.  Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions , 1987 .

[217]  Bahman Kalantari,et al.  Newton's method and generation of a determinantal family of iteration functions , 2000 .

[218]  Marc Deléglise,et al.  Short Polynomial Representations for Square Roots Modulo p , 2003, Des. Codes Cryptogr..

[219]  E. Kummer,et al.  Über die hypergeometrische Reihe . , 1836 .

[220]  Amy M. Fu,et al.  Cauchy Augmentation for Basic Hypergeometric Series , 2004 .

[221]  W. Stein.  Elementary Number Theory , 2008 .

[222]  Frank Ruskey,et al.  Simple Combinatorial Gray Codes Constructed by Reversing Sublists , 1993, ISAAC.

[223]  Vincent Vajnovszki.  Generating a Gray Code for P-Sequences , 2002, J. Math. Model. Algorithms.

[224]  David Gries,et al.  Generating a random cyclic permutation , 1988, BIT Comput. Sci. Sect..

[225]  Pierrick Gaudry,et al.  A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm , 2007, ISSAC '07.

[226]  A. A. Bennett.  The Four Term Diophantine Arccotangent Relation , 1925 .

[227]  Louis Vessot King,et al.  On the Direct Numerical Calculation of Elliptic Functions and Integrals , 2011 .

[228]  Ed F. Deprettere,et al.  Floating point Cordic , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.