- Home
-
Board
- Editorial Board
- Apply For Reviewer
-
Research Publishing Standards
- Guidelines
- Peer Review Policy
- Short Guide to New Editors
- Retraction Guidelines
- Research Institute
- Recommendations for the Board of Directors
- Editor Research Audit and Service Assessments
- Guidelines for Journals Publishers
- Code of Conduct for Journal Publishers
- Commandment in Social Media
- Suggestions
- Authorship Disputes
- Rights and Responsibilities
- Editors Home
- Visibility
- Information
- Apply for Editorial
- About
- Call for Paper
- Research Community
-
Journals
- Computer Science
-
Medical Research
- A: Neurology & Nervous System
- B: Pharma, Drug Discovery, Toxicology & Medicine
- C: Microbiology & Pathology
- D: Radiology, Diagnostic Imaging and Instrumentation
- E: Gynecology & Obstetrics
- F: Diseasescancer, ophthalmology & pediatric
- G: Veterinary Science & Veterinary Medicine
- H: Orthopedic & Musculoskeletal System
- I: Surgeries & Cardiovascular System
- J: Dentistry & Otolaryngology
- K: Interdisciplinary
- L:Nutrition and Food Science
- Engineering
- Science Frontier Research
- Management
-
Human-Social Science
- A: Arts & Humanities psychology, public administration, library sciences, sports, arts, media, music
- B: Geography, Environmental Science & Disaster Management
- C: Sociology & Culture
- D: History, Archaeology & Anthropology
- E: Economics
- F: Political Science
- G: Linguistics & Education
- H: Interdisciplinary
-
Fellow
-
Support
Account
×
A Review of NTLM Rainbow Table Generation Techniques
Meetika Malhotra, Bhushan Dua
Volume 13 Issue 7
Global Journal of Computer Science and Technology
Volume 13 Issue 7
Global Journal of Computer Science and Technology
Rainbow tables reduce the difficulty in brute force cracking a single password by creating a large pre-generated data set of hashes from nearly every possible password Rainbow Tables. This method, known as the Faster Time-Memory Trade-Off Technique, is based on research by Martin Hellman & Ronald Rivest done in the early 1980’s on the performance trade-offs between processing time and the memory needed for cryptanalysis. In this paper we review some of the most important works in rainbow table generation and using rainbow tables in window NT environment, i.e. against NTLM. We will discuss how NTLM is weak against rainbow table attacks.
