Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security and Cryptology

Inscrypt 2010: Information Security and Cryptology pp 95–104Cite as

A Family of Binary Threshold Sequences Constructed by Using the Multiplicative Inverse

  • Conference paper

  • 762 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6584))

Abstract

We point out that a family of pseudorandom binary lattices, which were constructed by using the multiplicative inverse, can be generated as binary threshold sequences. Hence we can estimate the well-distribution measure and the correlation measure of order ℓ of the binary lattices in terms of discrepancy bounds on corresponding pseudorandom numbers in the interval [0,1). We also consider the modified well-distribution measure and the modified correlation measure of order ℓ, which were introduced by Sárközy and Winterhof, for the binary lattices.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brandstätter, N., Winterhof, A.: Linear complexity profile of binary sequences with small correlation measure. Periodica Mathematica Hungarica 52(2), 1–8 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cassaigne, J., Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences, VII: the measures of pseudorandomness. Acta Arithmetica 103(2), 97–118 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, Z.: Finite binary sequences constructed by explicit inversive methods. Finite Fields and Their Applications 14(3), 579–592 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, Z., Gomez, D., Winterhof, A.: Distribution of digital explicit inversive pseudorandom numbers and their binary threshold sequence. In: L’Ecuyer, P., Owen, A.B. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2008, pp. 249–258. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Cusick, T.W., Ding, C.S., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Mathematical Library, vol. 66. Elsevier Science B.V., Amsterdam (2004) (revised ed.)

    MATH  Google Scholar 

  6. Hubert, P., Mauduit, C., Sárközy, A.: On pseudorandom binary lattices. Acta Arithmetica 125, 51–62 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Iwaniec, H., Kowalski, E.: Analytic Number Theory. American Mathematical Society Colloquium Publications, vol. 53. American Mathematical Society, Providence (2004)

    MATH  Google Scholar 

  8. Mauduit, C., Niederreiter, H., Sárközy, A.: On pseudorandom [0,1) and binary sequences. Publicationes Mathematicae Debrecen 71(3-4), 305–324 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences I: measures of pseudorandomness, the Legendre symbol. Acta Arithmetica 82, 365–377 (1997)

    MathSciNet  MATH  Google Scholar 

  10. Mauduit, C., Sárközy, A.: On the measures of pseudorandomness of binary sequences. Discrete Mathematics 271, 195–207 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mauduit, C., Sárközy, A.: On large families of pseudorandom binary lattices. Uniform Distribution Theory 2, 23–37 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Mauduit, C., Sárközy, A.: Construction of pseudorandom binary lattices by using the multiplicative inverse. Monatsh. Math. 153(3), 217–231 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Moreno, C.J., Moreno, O.: Exponential sums and Goppa codes. I. Proc. Amer. Math. Soc. 111, 523–531 (1991)

    MathSciNet  MATH  Google Scholar 

  14. Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. In: SIAM CBMSNSF Regional Conference Series in Applied Mathematics, vol. 63. SIAM, Philadelphia (1992)

    Google Scholar 

  15. Niederreiter, H., Winterhof, A.: Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators. Acta Arithmetica 93, 387–399 (2000)

    MathSciNet  MATH  Google Scholar 

  16. Sárközy, A., Winterhof, A.: Measures of pseudorandomness for binary sequences constructed using finite fields. Discrete Mathematics 309, 1327–1333 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Winterhof, A.: Incomplete additive character sums and applications. In: Jungnickel, D., et al. (eds.) Proceedings of the 5th International Conference on Finite Fields and Applications, Augsburg, pp. 462–474. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Winterhof, A.: Linear complexity and related complexity measures. In: Selected Topics in Information and Coding Theory, pp. 3–40. World Scientific, Singapore (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Applied Mathematics, Putian University, Fujian, 351100, China

    Zhixiong Chen & Chenhuang Wu

  2. College of Information Engineering, Qingdao University, Qingdao, Shandong, 266071, P.R. China

    Xiangguo Cheng

Authors
  1. Zhixiong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangguo Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chenhuang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, Dongchuan Road 800, 200240, Shanghai, China

    Xuejia Lai

  2. Columbia University, USA

    Moti Yung

  3. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China

    Dongdai Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Z., Cheng, X., Wu, C. (2011). A Family of Binary Threshold Sequences Constructed by Using the Multiplicative Inverse. In: Lai, X., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2010. Lecture Notes in Computer Science, vol 6584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21518-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21518-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21517-9

  • Online ISBN: 978-3-642-21518-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation