GATE CSE 2015 Set 1 | Network Security Question 6 | Computer Networks

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

-0.3

Suppose that everyone in a group of N people wants to communicate secretly with the N - 1 others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is

N(N - 1)

$${{N(N - 1)} \over 2}$$

(N - 1)²

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following are used to generate a message digest by the network security protocols?
(P) RSA
(Q) SHA-1
(R) DES
(S) MD5

P and R only

Q and R only

Q and S only

R and S only

GATE CSE 2013

MCQ (Single Correct Answer)

-0.3

Using public key cryptography, X adds a digital signature σ to message M, encrypts, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?

Encryption: X's private key followed by Y's private key;
Decryption: X’s public key followed by Y’s public key

Encryption: X's private key followed by Y's public key;
Decryption: X's public key followed by Y's private key

Encryption: X's public key followed by Y's private key;
Decryption: Y's public key followed by X's private key

Encryption: X's private key followed by Y's public key;
Decryption: Y's private key followed by X's public key

GATE CSE 2011

MCQ (Single Correct Answer)

-0.3

A layer-4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT

block entire HTTP traffic during 9:00 PM and 5:00 AM

block all ICMP traffic

stop incoming traffic from a specific IP address but allow outgoing traffic to the same IP address

block TCP traffic from a specific user on a multi-user system during 9:00 PM and 5:00 AM

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Numerical Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory