Review paper on Data Recovery using Brute Force Algorithm

Year : 2024 | Volume :15 | Issue : 03 | Page : –
By

Shifa Thamkin S.,

Raksha HM,

Mohammed Rafi,

  1. Student, Department of Computer Science & Engineering, University BDT College of Engineering (UBDT), Davangere, Karnataka, India
  2. Student, Department of Computer Science & Engineering, University BDT College of Engineering (UBDT), Davangere, Karnataka, India
  3. Professor, Department of Computer Science & Engineering, University BDT College of Engineering (UBDT), Davangere, Karnataka, India

Abstract

This paper delves into the intriguing field of data recovery, with a particular emphasis on the brute force approach, a powerful yet frequently underappreciated method. We begin by exploring the evolution of data recovery techniques since the 1970s and 1980s, examining traditional methods used to retrieve lost or corrupted data. Following this historical perspective, the paper provides a brief overview of various methodologies employed in data recovery, including techniques that leverage brute force. Brute force approaches, while often time-consuming, can be highly effective in recovering lost data, particularly when other methods fall short. The paper further compares brute force techniques with more modern data recovery methods, such as those utilizing machine learning algorithms, to highlight their relative strengths and weaknesses. In addition, we discuss potential future advancements in the field, focusing on improving computational efficiency and integrating brute force methods with emerging technologies like quantum computing and parallel processing. These advancements hold the promise of making data recovery faster and more accurate, thus broadening the application of brute force in critical situations. Ultimately, this paper aims to provide a comprehensive overview of data recovery techniques, with a forward-looking perspective on how brute force may evolve in the context of technological progress.

Keywords: Data recovery, Brute force, Time complexity, Space complexity, corrupted data, Machine Learning, Quantum Computing

[This article belongs to Journal of Computer Technology & Applications (jocta)]

How to cite this article:
Shifa Thamkin S., Raksha HM, Mohammed Rafi. Review paper on Data Recovery using Brute Force Algorithm. Journal of Computer Technology & Applications. 2024; 15(03):-.
How to cite this URL:
Shifa Thamkin S., Raksha HM, Mohammed Rafi. Review paper on Data Recovery using Brute Force Algorithm. Journal of Computer Technology & Applications. 2024; 15(03):-. Available from: https://journals.stmjournals.com/jocta/article=2024/view=177278

References

  1. What is Data Recovery?. 2024. Available from: https://www.geeksforgeeks.org/what-is-data-recovery/
  2. Boulos D, Zemljic N. Data Recovery. Available from: http://www.cs.toronto.edu/~arnold/427/15s/csc427/indepth/dataRecovery/DataRecovery_writeup.pdf ‌
  3. How to Recover Lost Data: A Step-by-Step Guide. Fields-data-recovery.com. 2021. Available from: https://www.fields-data-recovery.com/blog/how-to-recover-lost-data-a-step-by-step-guide
  4. How do you create a data recovery plan? – Darwin’s Data. 2023. Available from: https://darwinsdata.com/how-do-you-create-a-data-recovery-plan/ ‌
  5. William Stallings. CRYPTOGRAPHY AND NETWORK SECURITY PRINCIPLES AND PRACTICE. SEVENTH EDITION. GLOBAL EDITION. SPi Global. Pearson. Malaysia. https://www.cs.vsb.cz/ochodkova/courses/kpb/cryptography-and-network-security_-principles-and-practice-7th-global-edition.pdf
  6. Schneier B. Applied cryptography: protocols, algorithms, and source code in C. john wiley & sons; 2007.
  7. [New Research] Best Password Practices to Defend Against Modern Cracking Attacks. Specops Software. 2023. Available from: https://specopssoft.com/blog/best-password-practices-to-defend-against-modern-cracking-attacks/
  8. Whitney L. How an 8-character password could be cracked in just a few minutes. TechRepublic. 2023. Available from: https://www.techrepublic.com/article/how-an-8-character-password-could-be-cracked-in-less-than-an-hour/
  9. Alkhwaja I, Albugami M, Alkhwaja A, Alghamdi M, Abahussain H, Alfawaz F, Almurayh A, Min-Allah N. Password cracking with brute force algorithm and dictionary attack using parallel programming. Applied Sciences. 2023 May 12;13(10):5979.
  10. File carving | Infosec. Infosecinstitute.com. 2018. Available from: https://www.infosecinstitute.com/resources/digital-forensics/file-carving/
  11. Scalpel – A Frugal, High Performance File Carver – DFRWS. DFRWS. 2019. Available from: https://dfrws.org/presentation/scalpel-a-frugal-high-performance-file-carver/ ‌
  12. Carvey H, Altheide C. Digital forensics with open source tools. Elsevier; 2011 Mar 29.
  13. Data Corruption: Causes, Effects & Prevention DataCore. DataCore Software. 2024. Available from: https://www.datacore.com/glossary/data-corruption/
  14. Brian Carrier. File System Forensic Analysis. Addison Wesley Professional. 2005. Pearson Education, Inc. ISBN: 0-32-126817-2
  15. Kent K, Chevalier S, Grance T, Dang H. Special Publication 800-86 Guide to Integrating Forensic Techniques into Incident Response Recommendations of the National Institute of Standards and Technology. NIST; 2006 Aug. Available from: https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-86.pdf
  16. Garfinkel SL. Carving contiguous and fragmented files with fast object validation. digital investigation. 2007 Sep 1;4:2-12.
  17. Richard III GG, Roussev V. Scalpel: a frugal, high performance file carver. InDFRWS 2005 Aug 17.
  18. Datar M, Muthukrishnan S. Estimating rarity and similarity over data stream windows. InAlgorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings 10 2002 (pp. 323-335). Springer Berlin Heidelberg.
  19. Böhme R, Freiling FC. On metrics and measurements. Dependability metrics: advanced lectures. 2008:7-13.
  20. Goodrich MT, Tamassia R. Algorithm design: foundations, analysis, and internet examples. John Wiley & Sons; 2001 Oct 15.
  21. Ramkumar V, Balaji SB, Sasidharan B, Vajha M, Krishnan MN, Kumar PV. Codes for Distributed Storage. Foundations and Trends® in Communications and Information Theory. 2022;19(4):547–813. ‌
Regular Issue Subscription Review Article
Volume 15
Issue 03
Received 14/08/2024
Accepted 23/09/2024
Published 07/10/2024
Views: 67

Check Our other Platform for Workshops in the field of AI, Biotechnology & Nanotechnology.
Learn more
Check Out Platform for Webinars in the field of AI, Biotech. & Nanotech.
Learn more