Skip to main content

Advertisement

Springer Nature Link
Log in

Converting random bits into random numbers

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Converting random bits into random numbers is necessary for cryptographic protocols such as key agreements, public key encryptions, digital signatures and so on. In this paper, we propose the simple partial discard method and the complex partial discard method that convert random bits into random numbers. They are up to two times more efficient than standardized techniques.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. We developed the SPDM and the CDPM before Lumbroso published the FDR on arXiv.

  2. The reference code given in [7] is not optimal. Thus we optimized it.

References

  1. ANSI (1997) Public key cryptography using irreversible algorithms—part 1: the digital signature algorithm (DSA), ANSI X9.30-1

  2. ANSI (2006) Random number generation part 1: overview and basic principles, ANSI X9.82-1

  3. Bleichenbacher D (2000) On the generation of one-time keys in DL signature schemes. In: Presentation at IEEE P1363 working group meeting

  4. Horibe Y (1981) Entropy and an optimal random number transformations. IEEE Trans Inf Theory 27:527–529

    Article  MathSciNet  MATH  Google Scholar 

  5. ISO/IEC (2011) Information technology: security techniques—random bit generation, ISO/IEC 18031

  6. Knuth DE, Yao AC (1976) The complexity of nonuniform random number generation. Algorithms Complex 357–428

  7. Lumbroso J (2013) Optimal discrete uniform generation from coin flips, and applications, arXiv:1304.1916 [cs.DS] (2013).

  8. NIST (2012) Recommendation for random number generation using deterministic random bit generators, NIST Special Publication 800–90A

  9. NIST (2013) Digital Signature Standard (DSS), FIPS 186–4

  10. Shoup V (2010) NTL: a library for doing number theory. http://shoup.net/ntl/

Download references

Author information

Authors and Affiliations

  1. The Attached Institute of Electronics and Telecommunications Research Institute, Daejeon, Republic of Korea

    Bonwook Koo, Dongyoung Roh & Daesung Kwon

Authors
  1. Bonwook Koo
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Dongyoung Roh
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Daesung Kwon
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Dongyoung Roh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Koo, B., Roh, D. & Kwon, D. Converting random bits into random numbers. J Supercomput 70, 236–246 (2014). https://doi.org/10.1007/s11227-014-1202-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1202-1

Keywords