Skip to main content

Digital Quantum Forensics: Challenges and Responses

  • Conference paper
Future Information Technology

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 185))

  • 2039 Accesses

Abstract

Recent developments in technology suggest that within the next one to two decades some form(s) of quantum computing device will become viable. Once such devices become generally available they will doubtless be employed by cyber-criminals to perform brute-force decryption tasks that were previously infeasible. This paper attempts to address the question of how digital forensic investigation techniques will need to develop in order to respond to the challenges posed by such future generation computing devices.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reich, E.S.: Quantum Computers Move a Step Closer. Nature 467, 513 (2010)

    Article  Google Scholar 

  2. Shor, P.W.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proc. 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE Press, Los Alamitos (1994); quant-ph/9508027

    Chapter  Google Scholar 

  3. Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26, 1484–1509 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Grover, L.K.: A Fast Quantum Mechanical Algorithm for Database Search. In: Proc. 28th Annual ACM Symposium on the Theory of Computing, pp. 212–219 (May 1996); quant-ph/9605043

    Google Scholar 

  5. Grover, L.K.: Quantum Mechanics helps in Searching for a Needle in a Haystack. Phys. Rev. Letters 79, 325–328 (1997)

    Article  Google Scholar 

  6. Mermin, N.D.: Quantum Computer Science: an Introduction. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  7. Overill, R.E.: Parallelism of Paradigms in Non-Classical Computation. In: Stepney, S. (ed.) Proc. Intl. Workshop: The Grand Challenge in Non-Classical Computation, York, UK (April 2005)

    Google Scholar 

  8. Wootters, W.K., Zurek, W.H.: A Single Quantum Cannot be Cloned. Nature 299, 802–803 (1982)

    Article  Google Scholar 

  9. Dieks, D.: Communication by EPR devices. Physics Letters A 92(6), 271–272 (1982)

    Article  Google Scholar 

  10. Konstadopoulou, A.: From Quantum Security to Quantum Forensics. In: Proc. 1st Conference on Advances in Computer Security and Forensics (ACSF), Liverpool, UK, pp. 105–111 (July 2006)

    Google Scholar 

  11. Kwan, M., Chow, K.-P., Law, F., Lai, P.: Reasoning about Evidence using Bayesian Networks. In: Proc. 4th Annual IFIP WG 11.9 International Conference on Digital Forensics, Kyoto, Japan (January 2008); Advances in Digital Forensics IV, ch. 12, pp. 141–155. Springer, Heidelberg (2008)

    Google Scholar 

  12. Kwan, Y.K., Overill, R.E., Chow, K.-P., Silomon, J.A.M., Tse, H., Law, Y.W., Lai, K.Y.: Evaluation of Evidence in Internet Auction Fraud Investigations. In: Proc. 6th Annual IFIP WG 11.9 International Conference on Digital Forensics, Hong Kong (January 2010); Advances in Digital Forensics VI, ch. 7, pp. 95–106. Springer, Heidelberg (2010)

    Google Scholar 

  13. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  14. Kieras, D.: Using the Keystroke-Level Model to Estimate Execution Times, University of Michigan (2001), http://www.cs.loyola.edu/~lawrie/CS774/S06/homework/klm.pdf

  15. Overill, R.E., Silomon, J.A.M., Chow, K.-P.: A Complexity Based Model for Quantifying Forensic Evidential Probabilities. In: Proc. 3rd International Workshop on Digital Forensics (WSDF 2010), Krakow, Poland, pp. 671–676 (February 2010)

    Google Scholar 

  16. Overill, R.E., Silomon, J.A.M.: Digital Meta-Forensics: Quantifying the Investigation. In: Proc. 4th International Conference on Cybercrime Forensics Education & Training (CFET 2010), Canterbury, UK (September 2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Overill, R.E. (2011). Digital Quantum Forensics: Challenges and Responses. In: Park, J.J., Yang, L.T., Lee, C. (eds) Future Information Technology. Communications in Computer and Information Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22309-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22309-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22308-2

  • Online ISBN: 978-3-642-22309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics