Skip to main content
SpringerLink
Log in

Improvement of KMRNG Using n-Pendulum

  • Conference paper
  • First Online:
Intelligent Computing Theories and Application (ICIC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9772))

Included in the following conference series:

Abstract

The report mostly concentrates on ‘Keyboard Mouse Random Number Generator (KMRNG)’, which is made to overcome the limit of TRNG/PRNG and also including advantages of it being easy to be commercialized, by using Keyboard and Mouse inputs. Comparing SFMT (PRNG) and KMRNG with TestU01 showed us that even though KMRNG was proven suitable for random number generator, its statistical randomness was lower than that of SFMT. This also let us improve the KMRNG’s statistical performance by applying the statistical characteristic of the multiple pendulum.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

References

  1. L’Ecuyer, P., Simard, R.: TestU01: A Software Library in ANSI C for Empirical Testing of Random Number Generators (2007)

    Google Scholar 

  2. Saito, M., Matsumoto, M.: SIMD-oriented fast mersenne twister: a 128-bit pseudorandom number generator. In: Keller, A., Heinrich, S., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 607–622. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM trans. model. comput. simul. 8(1), 3–30 (1998)

    Article  MATH  Google Scholar 

  4. Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15(2), 364–383 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jones, R.M., Patel, K.N.: Examination of chaos in multiple pendulum systems through computer visualization in Java (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HAFS, Yongin, Korea

    Jae Jun Lee, Sungyoung Lee & Taeseon Yoon

Authors
  1. Jae Jun Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungyoung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Taeseon Yoon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jae Jun Lee .

Editor information

Editors and Affiliations

  1. Tongji University , Shanghai, China

    De-Shuang Huang

  2. University of Ulsan , Ulsan, Korea (Republic of)

    Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Lee, J.J., Lee, S., Yoon, T. (2016). Improvement of KMRNG Using n-Pendulum. In: Huang, DS., Jo, KH. (eds) Intelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science(), vol 9772. Springer, Cham. https://doi.org/10.1007/978-3-319-42294-7_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42294-7_60

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42293-0

  • Online ISBN: 978-3-319-42294-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation