Advertisement

Multisequence Synthesis over an Integral Domain

  • Li-ping Wang
  • Yue-fei Zhu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2146)

Abstract

We first give an extension of F[x]-lattice basis reduction algorithm to the polynomial ring R[x] where F is a field and R an arbitrary integral domain. So a new algorithm is presented for synthesizing minimum length linear recurrence (or minimal polynomials) for the given multiple sequences over R. Its computational complexity is O(N 2) multiplications in R where N is the length of each sequence. A necessary and sufficient conditions for the uniqueness of minimal polynomials are given. The set of all minimal polynomials is also described.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fitzpatrick, P., Norton, G. H.: The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain. AAECC, 6 (1995) 309–323zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Lu, P. Z., Liu, M. L.: Gröbner basis for characteristic ideal of linear recurrence sequence over UFD. Science in China (Series A), vol. 28, No. 6. 508–519 (1998)Google Scholar
  3. 3.
    Norton, G. H.: On shortest linear recurrences. J. Symb. Comp. 27 (1999) 325–349zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Schmidt, W. M.: Construction and estimation of bases in function fields. J. Number Theory 39, no. 2, 181–224 (1991)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Wang, L. P., Zhu, Y. F.: F[x]-lattice basis reduction algorithm and multisequence synthesis. Science in China, in pressGoogle Scholar
  6. 6.
    Lenstra, A. K., Lenstra, H. W., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann., vol. 261 (1982) 515–534zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Lagarias, J. C., Odlyzko, A. M.: Soluting low density subset problems. Pro. 24th Annual IEEE Symp. on Found of Comp. Science (1983) 1–10Google Scholar
  8. 8.
    Coppersmith, D.: Small solutions to polynomial equations and low exponent RSA vulnerabilities. Journal of Cryptology 10 (1997) 233–260zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Berlekamp, E. R.: Algebraic Coding Theory. New York: McGrawHill (1968)zbMATHGoogle Scholar
  10. 10.
    Massey, J. L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory, vol. IT-15, no. 1, 122–127 (1969)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Li-ping Wang
    • 1
  • Yue-fei Zhu
    • 2
  1. 1.State Key Laboratory of Information Security, Graduate SchoolUniversity of Science and Technology of ChinaBeijingChina
  2. 2.Department of Network EngineeringInformation Engineering UniversityZhengzhouChina

Personalised recommendations