Hashing (OCR A-Level Computer Science): Flashcards

📚Flashcards
Hashing
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

13 cards from this deck

Show

What does hashing convert data into?

Fixed-size string of characters (hash value/code)

Output of a hash function

Hash value or hash code

Key property: same input always produces

Same hash output (deterministic)

Length of hash values regardless of input size

Fixed length (e.g., 256 bits for SHA-256)

Collision in hashing

Two different inputs producing the same hash

Why hash functions are one-way functions

Computationally infeasible to derive original data from hash

MD5 hash size and security status

128-bit hash, considered weak

SHA-1 hash size and security status

160-bit hash, considered insecure

SHA-256 hash size and security status

256-bit hash, most secure and widely used

Effect of tiny change in data on hash

Produces completely different hash

What is stored instead of plaintext passwords

Hash of the password

Time complexity benefit of hash tables

Constant time complexity

Additional security measure for password hashing

Salting

Explore OCR A-Level Computer Science Revision Notes by Topics

Explore OCR A-Level Computer Science Model Answers by Topics

Explore OCR A-Level Computer Science Quizzes by Topics

Explore OCR A-Level Computer Science Exam Questions by Topics

Join 100,000+ A-Level students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.