NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

Network Security

Computer Networks

Previous Years Questions

Marks 1

More
The value of 351 mod 5 is_________.
GATE CSE 2019
A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one o...
GATE CSE 2017 Set 1
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires
GATE CSE 2016 Set 2
Suppose that everyone in a group of N people wants to communicate secretly with the N - 1 others using symmetric key cry...
GATE CSE 2015 Set 1
Which one of the following are used to generate a message digest by the network security protocols? (P) RSA (Q) SHA-1 (...
GATE CSE 2014 Set 1
Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it to Y, where it is decry...
GATE CSE 2013
A layer-4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT
GATE CSE 2011
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest up...
GATE CSE 2007
The minimum positive integer p such that (3p modulo 17) = 1 is
GATE CSE 2007
Consider the following two statements: i. A hash function (these are often used for computing digital signatures) is an...
GATE CSE 2007
A sender is employing public key Cryptography to send a secret message to a receiver. Which one of the following stateme...
GATE CSE 2004

Marks 2

More
In an RSA cryptosystem, the value of the public modulus parameter n is 3007. If it is also known that $$\varphi $$(n) = ...
GATE CSE 2019
Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A a...
GATE CSE 2016 Set 1
In the RSA public key cryptosystem, the private and public keys are (e, n) and (d, n) respectively, where n = p$$ \times...
GATE CSE 2009
The total number of keys required for a set of n individuals to be able to communicate with each other using secret key ...
GATE CSE 2008
Suppose that two parties A and B wish to setup a common secret key (D - H key) between themselves using the Diffie-Hellm...
GATE CSE 2005

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12