Skip to main content
SpringerLink
Log in

A Review of Modern Cryptography: From the World War II Era to the Big-Data Era

  • Chapter
  • First Online:
Optimization and Control for Systems in the Big-Data Era

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 252))

  • 1470 Accesses

Abstract

This chapter briefly surveys the rapid development of Modern Cryptography from World War II (WW-II) to the prevailing Big-Data Era. Cryptography is the art and science of secret communication, which concerns about C.I.A., i.e., Confidentiality, Integrity, and Authentication of information, so as to guarantee the safety during information transmission. Meanwhile Authentication is the key step in information security, where an excellent example is online payment systems, which belongs to the field of Financial Technology (Fin-Tech) and is booming on multiple markets in recent years. The concept “Quantum” is popular in the recent decade, and the possibilities of inventing Quantum Cryptosystems are also raised in the literature, which is a promising direction in Modern Cryptosystem. We also select two classical cryptosystems, i.e., the Merkle–Hellman knapsack cryptosystem, and the subset sum problem (SSP)-based cryptosystem to present the mechanisms in encryption and decryption processes. Apart from being a brief survey, this chapter is also intended as an entry point to guide readers to this interesting and important field.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • F. Black, R. Litterman, Global portfolio optimization. Financ. Anal. J. 48 (5), 28–43 (1992)

    Article  Google Scholar 

  • M.R. Bremner, Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications (CRC, Boca Raton, FL, 2011)

    Google Scholar 

  • E.F. Brickell, Solving low density knapsacks, in Advances in Cryptology, Proceedings of CRYPTO ’83, Santa Barbara, CA, August 21–24, 1983, ed. by D. Chaum (Plenum, New York, 1983), pp. 25–37

    Google Scholar 

  • V. Cerf, J.E. Hopcroft, R.E. Kahn, R.L. Rivest, A. Shamir, Information, data, security in a networked future, in ACM-TURING’12 ACM Turing Centenary Celebration, San Francisco, CA, June 15–16, no. 14 (2012)

    Google Scholar 

  • M.J. Coster, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr, An improved low-density subset sum algorithm, in Advances in Cryptology: Proceedings of Eurocrypt ’91 (1991), pp. 54–67

    Google Scholar 

  • M.J. Coster, A. Joux, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr, J. Stern, Improved low-density subset sum algorithms. Comput. Complex. 2, 111–128 (1992)

    Article  Google Scholar 

  • W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory IT-22, 644–654 (1976)

    Article  Google Scholar 

  • A.M. Frieze, On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM J. Comput. 15, 536–539 (1986)

    Article  Google Scholar 

  • J. Gao, D. Li, X. Cui, S. Wang, Time cardinality constrained mean-variance dynamic portfolio selection and market timing: a stochastic control approach. Automatica 54, 91–99 (2015)

    Article  Google Scholar 

  • M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979)

    Google Scholar 

  • Gartner, Gartner says solving ‘big data’ challenge involves more than just managing volumes of data. Gartner Special Report Examines How to Leverage Pattern-Based Strategy to Gain Value in Big Data (June 27, 2011)

    Google Scholar 

  • F. Glover, R.E. Woolsey, Aggregating diophantine equations. Z. Oper. Res. 16, 1–10 (1972)

    Google Scholar 

  • M. Hillbert, Big data for development: a review of promises and challenges. Dev. Policy Rev. 34, 1–41 (2015)

    Google Scholar 

  • S.M. Jen, C.Y. Lu, T.L. Lai, J.F. Yang, Empirical exploration of lattice attacks for building secure knapsack cryptosystems, in 2012 International Conference on Anti-Counterfeiting, Security and Identification (IEEE, New York, 2012a), pp. 1–5

    Google Scholar 

  • S.M. Jen, T.L. Lai, C.Y. Lu, J.F. Yang, Knapsack cryptosystems and unreliable reliance on density, in AINA, ed. by L.T. Barolli, F. Enokido, Xhafa, M. Takizawa (IEEE, New York, 2012b), pp. 748–754

    Google Scholar 

  • W. Jennifer, Solving the Enigma: History of the Cryptanalytic Bombe (Center for Cryptological History, National Security Agency, Fort George G. Meade, 2006)

    Google Scholar 

  • J.C. Lagarias, A.M. Odlyzko, Solving low-density subset sum problems, in 24th Annual Symposium on Foundations of Computer Science, 7–9 November 1983, Tucson, AZ (IEEE, New York, 1983), pp. 1–10

    Google Scholar 

  • J.C. Lagarias, A.M. Odlyzko, Solving low-density subset sum problems. J. Assoc. Comput. Mach. 32, 229–246 (1985)

    Article  Google Scholar 

  • H.W. Lenstra, Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538–548 (1983)

    Article  Google Scholar 

  • A.K. Lenstra, H.W. Lenstra Jr., L. Lovász, Factoring polynomials with rational coefficients. Math. Ann. 261, 515–534 (1982)

    Article  Google Scholar 

  • D. Li, X. Sun, J. Gao, S. Gu, X. Zheng, Reachability determination in acyclic Petri nets by cell enumeration approach. Automatica 47, 2094–2098 (2011)

    Article  Google Scholar 

  • L. Lovász, H.E. Scarf, The generalized basis reduction algorithm. Math. Oper. Res. 17, 751–764 (1992)

    Article  Google Scholar 

  • B. Lu, Linear diophantine equations: integration of disaggregation with LLL algorithm. Ph.D. Thesis, The Chinese University of Hong Kong (2014)

    Google Scholar 

  • B. Lu, D. Li, Tackling density one subset sum problems: integration of disaggregation technique with lattice attacks. Working paper (2016)

    Google Scholar 

  • H. Markowitz, Portfolio selction. J. Financ. 7 (1), 77–91 (1952)

    Google Scholar 

  • R.C. Merkle, M.E. Hellman, Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theory IT-24, 525–530 (1978)

    Article  Google Scholar 

  • P.Q. Nguyen, B. Vallée (eds.) The LLL Algorithm: Survey and Applications. Information Security and Cryptography. Springer, Berlin, Heidelberg (2010)

    Google Scholar 

  • T. Okamoto, K. Tanaka, S. Uchiyama, Quantum public-key cryptosystems, in Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, CA, August 20–24, 2000, Proceedings, ed. by M. Bellare. Lecture Notes in Computer Science, vol. 1880 (Springer, Berlin, 2000), pp. 147–165

    Google Scholar 

  • R. Rivest, The MD5 Message-Digest Algorithm (MIT Laboratory for Computer Science and RSA Data Security, Cambridge, MA, 1992)

    Book  Google Scholar 

  • R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (2), 120–126 (1978)

    Article  Google Scholar 

  • C.P. Schnorr, M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, in Fundamentals of Computation Theory, 8th International Symposium, FCT 91, Gosen, September 9–13, 1991, Proceedings, ed. by L. Budach. Lecture Notes in Computer Science, vol. 529 (Springer, Berlin, 1991), pp. 68–85

    Google Scholar 

  • C.P. Schnorr, M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181–191 (1994)

    Article  Google Scholar 

  • C.P. Schnorr, T. Shevchenko, Solving subset sum problems of density close to 1 by “randomized” BKZ-reduction. IACR Cryptol. ePrint Archive, 1–5 (2012)

    Google Scholar 

  • A. Shamir, A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. IEEE Trans. Inf. Theory IT-30, 699–704 (1984)

    Article  Google Scholar 

  • S. Singh, The Code Book: The Science of Secrecy From Ancient Egypt to Quantum Cryptography (Anchor, New York, 1999)

    Google Scholar 

  • X. Wang, H. Yu, How to break MD5 and other hash functions, in Advances in Cryptology - EUROCRYPT 2005. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 19–35

    Google Scholar 

  • J. Watling, China’s internet giants lead in online finance. The Financialist (Retrieved 15 February 2014), Credit Suisse

    Google Scholar 

  • S. Zhu, M. Fan, D. Li, Portfolio management with robustness in both prediction and decision: a mixture model based learning approach. J. Econ. Dyn. Control 48, 1–25 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

We would like to express our gratitude to Prof. Duan Li for sharing his comments and suggestions on this paper. We also would like to thank Dr. Junxian HUANG, the CEO of BeeCloud CO., Ltd. for sharing his knowledge on online payment systems, and Dr. Don HUANG for sharing his knowledge on Black–Litterman model.

Author information

Authors and Affiliations

  1. Quantitative Researcher, Portfolio Management Department, Foresea Life Insurance Co., Ltd., Shenzhen, China

    Bojun Lu

Authors
  1. Bojun Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bojun Lu .

Editor information

Editors and Affiliations

  1. Institute of Textiles and Clothing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    Tsan-Ming Choi

  2. School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China

    Jianjun Gao

  3. Department of Systems and Information Engineering, University of Virginia, Charlottesville, Virginia, USA

    James H. Lambert

  4. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Chi-Kong Ng

  5. Department of Management Science and Engineering, Business School, Qingdao University, Shandong, China

    Jun Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Lu, B. (2017). A Review of Modern Cryptography: From the World War II Era to the Big-Data Era. In: Choi, TM., Gao, J., Lambert, J., Ng, CK., Wang, J. (eds) Optimization and Control for Systems in the Big-Data Era. International Series in Operations Research & Management Science, vol 252. Springer, Cham. https://doi.org/10.1007/978-3-319-53518-0_7

Download citation

Publish with us

Policies and ethics

Search

Navigation