Scribd
Upload
88 views2 pages

NS Answer

The document describes a one-way authentication protocol based on asymmetric encryption, specifically a variant of the Needham-Schroeder Public-Key Protocol, where party A is authenticated to party B using a nonce and digital signature. It also explains the steps involved in reducing the number 9794 modulo 73, resulting in a congruence of 12, and notes that Fermat's Little Theorem is not necessary for this calculation. The protocol emphasizes authentication and replay protection, while also highlighting the lack of confidentiality.

Uploaded by

sekardharani209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
88 views2 pages

NS Answer

The document describes a one-way authentication protocol based on asymmetric encryption, specifically a variant of the Needham-Schroeder Public-Key Protocol, where party A is authenticated to party B using a nonce and digital signature. It also explains the steps involved in reducing the number 9794 modulo 73, resulting in a congruence of 12, and notes that Fermat's Little Theorem is not necessary for this calculation. The protocol emphasizes authentication and replay protection, while also highlighting the lack of confidentiality.

Uploaded by

sekardharani209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

1.

Identify the protocol used for the following one-way authentication technique based on
asymmetric encryption. And explain the protocol.
A→B: IDA
B→A:R1
AB: E(PRa, R1)
ANSWER:

The protocol described here is an asymmetric encryption-based challenge-response


authentication mechanism, commonly referred to as part of the Needham-Schroeder Public-
Key Protocol (specifically, its one-way authentication variant).

Given Protocol Steps:

1. A → B: IDA
o A (the client) sends its identity to B (the server).
2. B → A: R1
o B responds with a random nonce R1R1R1 to challenge A. This is used to ensure
the freshness of the communication (to prevent replay attacks).
3. A → B: E(PRa, R1)
o A signs the nonce R1 using its private key (PRa) and sends it back. This is
essentially encrypting R1 with A's private key.

Protocol Explanation:

This is a one-way authentication protocol where only party A is authenticated to party B.

 Step 1 (IDA): A initiates the protocol by revealing its identity.


 Step 2 (R1): B generates a random number (nonce) and sends it to A as a challenge.
 Step 3 (E(PRa, R1)): A signs the nonce using its private key. When B receives this, it
verifies the signature using A’s public key (PUa).

If the decrypted message using PUa matches R1, B is assured that the message could only
have come from A (since only A possesses PRa).

Security Purpose:

 Authentication: Verifies that the sender is indeed A, by checking that only A could have
signed the nonce correctly.
 Replay Protection: The nonce R1 ensures that old authentication messages cannot be
reused.

Important Notes:

 No confidentiality is provided in this protocol, as it's purely for authentication.


 If mutual authentication is needed (A authenticates B as well), additional steps are
required.
 This is not the complete Needham-Schroeder Public-Key Protocol, but a simplified
form focused on one-way authentication using public-key cryptography.

2. Use Fermat's theorem to find a number between 0 and 72 with a congruent to 9794 modulo 73.

Find a number aaa such that a≡9794(mod73)a \equiv 9794 \pmod{73}a≡9794(mod73), and 0≤a<730 \leq
a < 730≤a<73

This means we want to reduce 9794 modulo 73.

Step 1: Use division to reduce 9794 mod 73

We compute:

9794mod 739794 \mod 739794mod73

You can do this by dividing 9794 by 73 and taking the remainder:

9794÷73=134.082⇒73×134=9782
9794−9782=12

So:

9794≡12(mod73)

Step 2: Fermat’s Little Theorem (just in case)

Fermat's Little Theorem says:

If p is prime and a!=0 (mod p), then AP-1=1(modp)

This is useful if we were doing exponentiation modulo 73, but here we just needed to reduce a number
mod 73. So Fermat’s theorem isn't needed in this case — simple division gives the answer.12

You might also like