Question 5 (a)
Authentication of electronic records
9.375 marks
- Time to write
- About 19 minutes
From an older CBCS paper
Question
Question 5 (a) · 9.375 marksQ.5. “By using Hash Function and Asymmetric Crypto System, Electronic record can be authenticated”. Explain,
Reworded from the university paper; the task is the same. The original paper belongs to the University of Delhi. See DU's question bank.
Before you write
Read off the question and its marks
Read from the question
- ExplainTie the answer to the quoted statement: say what it means first, and come back to it at the end.
What the paper leaves open
The paper prints no mark per question (any four of six, equal marks, 75 in all); each question is reckoned here at 18.75 marks. This older-course question examines the Information Technology Act, 2000, which the current UGCF Business Laws syllabus does not name; it is answered as printed. Marked as one question of 18.75 marks; answered here in 2 parts of 9.375 marks each (marks inferred).
Write it in this order
- Read; underline the asks; jot your points 1 min
- 1 Authentication of an electronic record 2.2 marks 4 min
- 2 Hash function 2.2 marks 4 min
- 3 Asymmetric crypto system 2.2 marks 4 min
- 4 Verification 2.6 marks 5 min
- Check: every ask answered, key terms underlined 1 min
Short on time? Trim steps 1–4 evenly rather than skip one: each is capped at its own marks.
Try it first. About 19 minutes for 9.375 marks. Write it out, then open the solution.
Solution
Hover or tap a marked figure, like 72,000, to see how it is made and where else it appears.
Authentication of an electronic record. Section 3 of the Information Technology Act, 2000 provides that “any subscriber may authenticate an electronic record by affixing his digital signature”, and that the authentication shall be effected by the use of an asymmetric crypto system and a “hash function which envelop and transform the initial electronic record into another electronic record”. The statement is therefore correct.
Hash function. It is “an algorithm mapping or translation of one sequence of bits into another, generally smaller, set known as” (s. 3) the “hash result, such that an electronic record yields the same hash result every time the algorithm is executed with” that record as input, and it is computationally infeasible (a) to derive or reconstruct the original record from the hash result, and (b) for two electronic records to produce the same hash result. So it is computationally infeasible to alter the record without changing its hash result; the Act does not say a collision is impossible.
Asymmetric crypto system. It is “a system of a secure key pair consisting of a private key for creating a digital signature and a public key to verify the digital signature” (section 2(1)(f)). The subscriber signs with his private key, which he alone holds.
Verification. Verifying determines whether the record was signed with the private key corresponding to the subscriber's public key and whether it has been retained intact since it was signed.
Where the 9.375 marks sit
| # | Component | Marks |
|---|---|---|
| 1 | Authentication of an electronic record | 2.25 |
| 2 | Hash function | 2.25 |
| 3 | Asymmetric crypto system | 2.25 |
| 4 | Verification | 2.625 |
| Total | 9.375 |
Report a problemopens an email to admin@getkunji.com with the question IDBLH20OC-Q5aalready filled in.