Explain about RSA algorithm.

Explain about RSA algorithm.
by

1 Answer

Answer :

∙ Public key Encryption technique.  
∙ Encryption algorithm  
∙ Decryption algorithm  
∙ Security in RSA
by

Related questions

In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Last Answer : 17

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Description : Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Last Answer : Answer: Marks to all Explanation: p=3, q=13, d=7, e=3, M=5, C=? C = Me mod n n = p*q  = 3*13 = 39 C = 53 mod 39 = 8 Answer is 8.

In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets

Description : In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets 

Last Answer : Answer: 2

__________ augments the CSMA algorithm todetect collision. A) CSMA/CA B) CSMA/CD C) either (a)or (b) D) both (a) and (b

Description : __________ augments the CSMA algorithm todetect collision. A) CSMA/CA B) CSMA/CD C) either (a)or (b) D) both (a) and (b

Last Answer : CSMA/CD

The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above

Description : The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

If delaysare recorded as 10 bit numbers in a 50 router network, and delay vectorsare exchanged twicea second,how muchbandwidth per fill duplex line is occupied by the distributedrouting algorithm? A. 500 bps B. 1500 bps C. 5 bps D. 1000 bps

Description : If delaysare recorded as 10 bit numbers in a 50 router network, and delay vectorsare exchanged twicea second,how muchbandwidth per fill duplex line is occupied by the distributedrouting algorithm? A. 500 bps B. 1500 bps C. 5 bps D. 1000 bps

Last Answer : 1000 bps

A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Description : A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Last Answer : hot potatorouting

Which algorithm is used to shape the bursty traffic into a fixed rate traffic by averaging the data rate? a. solid bucket algorithm b. spanning tree algorithm c. hocken helm algorithm d. leaky bucket algorithm

Description : Which algorithm is used to shape the bursty traffic into a fixed rate traffic by averaging the data rate? a. solid bucket algorithm b. spanning tree algorithm c. hocken helm algorithm d. leaky bucket algorithm

Last Answer : d. leaky bucket algorithm

In the slow start phase of the TCP congestion control algorithm, the size of the congestion window a. does not increase b. increases linearly c. increases quadratically d. increases exponentially

Description : In the slow start phase of the TCP congestion control algorithm, the size of the congestion window a. does not increase b. increases linearly c. increases quadratically d. increases exponentially

Last Answer : d. increases exponentially

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission. a. 8 MSS b. 14 MSS c. 7 MSS d. 12 MSS

Description : Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is ... the end of the tenth transmission. a. 8 MSS b. 14 MSS c. 7 MSS d. 12 MSS

Last Answer : c. 7 MSS

Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm

Description : Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm

Last Answer : a. Flow Control Policy

Which one of the following algorithm is not used for congestion control? a. traffic aware routing b. admission control c. load shedding d. routing information protocol

Description : Which one of the following algorithm is not used for congestion control? a. traffic aware routing b. admission control c. load shedding d. routing information protocol

Last Answer : d. routing information protocol

Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned

Description : Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned

Last Answer : d. all of the mentioned

Distance Vector Routing is a……... routing algorithm, it consists of a data structure called a ……… A. Static , routing table B. Dynamic, look-up tableC. Dynamic, routing table D. Static, look-up table

Description : Distance Vector Routing is a……... routing algorithm, it consists of a data structure called a ……… A. Static , routing table B. Dynamic, look-up table C. Dynamic, routing table D. Static, look-up table

Last Answer : C. Dynamic, routing table

Flooding is also a……... algorithm, usually generates ………... of duplicate packets. A. Static, vast number B. dynamic , vast number C. Static, less number D. dynamic , less number

Description : Flooding is also a……... algorithm, usually generates ………... of duplicate packets. A. Static, vast number B. dynamic , vast number C. Static, less number D. dynamic , less number

Last Answer : A. Static, vast number

______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Description : ______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Last Answer : A. Flooding

In the ________ algorithm of TCP, the size of the congestion window increases exponentially until it reaches a threshold A. slow-start B. congestion avoidance C. congestion detection D. none of the above

Description : In the ________ algorithm of TCP, the size of the congestion window increases exponentially until it reaches a threshold A. slow-start B. congestion avoidance C. congestion detection D. none of the above

Last Answer : A. slow-start

Can you explain RSA encryption keys in simple enough language for me?

Description : Can you explain RSA encryption keys in simple enough language for me?

Last Answer : answer:As I understand it (general disclaimer) The public key serves two purposes 1) Hey, I'm using encryption, so we'll have to converse using that, ok? 2) Here's the decoder ring I'm going to ... 't want your key to work anymore, I just change the lock, since I can't necessarily take your key.

On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Description : On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Last Answer : ANSWER: D

Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Description : Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Last Answer : ANSWER: A

Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Description : Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Last Answer : ANSWER: A

On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Description : On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Last Answer : ANSWER: D

On just 31 balls _________ hit a century in 2015 vs West Indies. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Mark Boucher (RSA)

Description : On just 31 balls _________ hit a century in 2015 vs West Indies. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Mark Boucher (RSA)

Last Answer : ANSWER: C

Only played 16 balls for 50 runs which is a world record in ODI history. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Sanath Jayasuriya (SL)

Description : Only played 16 balls for 50 runs which is a world record in ODI history. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Sanath Jayasuriya (SL)

Last Answer : ANSWER: C

On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Description : On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Last Answer : ANSWER: D

Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Description : Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Last Answer : ANSWER: A

Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Description : Only played 16 balls for 50 runs which is a world record in ODI history. A. AB de Villiers (RSA) B. Corey Anderson (NZ) C. Shahid Afridi (PAK) D. Sanath Jayasuriya (SL)

Last Answer : ANSWER: A

On just 31 balls _________ hit a century in 2015 vs West Indies. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Mark Boucher (RSA)

Description : On just 31 balls _________ hit a century in 2015 vs West Indies. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Mark Boucher (RSA)

Last Answer : ANSWER: C

On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Description : On just 31 balls _________ hit a century in 2015 vs West Indies. A. Mark Boucher (RSA) B. Shahid Afridi (PAK) C. Corey Anderson (NZ) D. AB de Villiers (RSA)

Last Answer : ANSWER: D

Only played 16 balls for 50 runs which is a world record in ODI history. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Sanath Jayasuriya (SL)

Description : Only played 16 balls for 50 runs which is a world record in ODI history. A. Corey Anderson (NZ) B. Shahid Afridi (PAK) C. AB de Villiers (RSA) D. Sanath Jayasuriya (SL)

Last Answer : ANSWER: C

Which of the following is involved in the digital marketing process? a. RSA b. Voice Broadcasting c. Podcasting d. All of the above

Description : Which of the following is involved in the digital marketing process? a. RSA b. Voice Broadcasting c. Podcasting d. All of the above

Last Answer : d. All of the above

Digital marketing includes_____________. A. voice broadcast B. podcasting C. RSA D. Both A and B

Description : Digital marketing includes_____________. A. voice broadcast B. podcasting C. RSA D. Both A and B

Last Answer : D. Both A and B

Digital marketing includes_____________. voice broadcast  podcasting  RSA  Both A and B

Description : Digital marketing includes_____________.  voice broadcast  podcasting  RSA  Both A and B

Last Answer :  Both A and B

Digital marketing includes_________.  A. RSA  B. Podcasting  C. Voice broadcast  D. Both B & C

Description : Digital marketing includes_________.  A. RSA  B. Podcasting  C. Voice broadcast  D. Both B & C

Last Answer : D. Both B & C

Digital marketing includes_____________. A. voice broadcast B. podcasting C. RSA D. Both A and B

Description : Digital marketing includes_____________. A. voice broadcast B. podcasting C. RSA D. Both A and B

Last Answer : D. Both A and B

Which one is an encryption technique? a. RSA b. DES c. AES d. All of the above

Description : Which one is an encryption technique? a. RSA b. DES c. AES d. All of the above

Last Answer : d. All of the above

Which one is not an encryption technique? a. RSA b. DES c. AES d. FTP

Description : Which one is not an encryption technique? a. RSA b. DES c. AES d. FTP

Last Answer : d. FTP

Which one is not a encryption technique a. RSA b. DES c. AES d. NONE OF THE ABOVE

Description : Which one is not a encryption technique a. RSA b. DES c. AES d. NONE OF THE ABOVE

Last Answer : d. NONE OF THE ABOVE

In Electronic cash payment a. a debit card payment system is used b. a customer buys several electronic coins which are digitally signed by coin issuing bank c. a credit card payment system is used d. RSA cryptography is used in the transactions

Description : In Electronic cash payment a. a debit card payment system is used b. a customer buys several electronic coins which are digitally signed by coin issuing bank c. a credit card payment system is used d. RSA cryptography is used in the transactions 

Last Answer : b. a customer buys several electronic coins which are digitally signed by coin issuing bank 

Public key encryption method is a system a. which uses a set of public keys one for each participant in e-Commerce b. in which each person who wants to communicate has two keys; a private key known to him only and a public key which is publicized to enable others to send message to him. c. which uses the RSA coding system. d. which is a standard for use in e-Commerce.

Description : Public key encryption method is a system a. which uses a set of public keys one for each participant in e-Commerce b. in which each person who wants to communicate has two keys; a private key known to him ... him. c. which uses the RSA coding system. d. which is a standard for use in e-Commerce.  

Last Answer : b. in which each person who wants to communicate has two keys; a private key known to him only and a public key which is publicized to enable others to send message to him.

Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Description : Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Last Answer : (C) 103 Explanation: Basic RSA Algorithm: 1. Choose two primes, p & q. 2. Compute n=p*q and z=(p-1)*(q-1). 3. Choose a number relatively prime to z and call it d. 4. Find e such that e*d= ... each of these in turn by 7 to see which is divisible by 7, we find that 721/7 = 103, hence e = 103. 

Q No. 3: (a) How MMU is used to address the physical and logical cache arrangement Explain the difference between Least recently used and least frequently used replacement algorithm?

Description : Q No. 3: (a) How MMU is used to address the physical and logical cache arrangement Explain the difference between Least recently used and least frequently used replacement algorithm?

Last Answer : Q No. 3: (a) How MMU is used to address the physical and logical cache arrangement? Explain the difference between Least recently used and least frequently used replacement algorithm.

Explain the function of Rete Algorithm?

Description : Explain the function of Rete Algorithm?

Last Answer : This algorithm preprocess the set of rules in KB to constant a sort of data flow network in which each node is a literals from rule a premise.

Explain and write steps for DDA line drawing algorithm.

Description : Explain and write steps for DDA line drawing algorithm. 

Last Answer : This algorithm generates a line from differential equations of line and hence the name DDA. DDA algorithm is an incremental scan conversion method. A DDA is hardware or software used for linear interpolation of variables over ... : Steps 1: Read the end points of line (x1,y1) and (x2,y2).

Explain Cyrusblek line clipping algorithm.

Description : Explain Cyrusblek line clipping algorithm.

Last Answer : Cyrus Beck Line Clipping algorithm: Cyrus Beck Line Clipping algorithm is used to clip 2D/3D lines against convex polygon/polyhedron. Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. ... Step 12 : Draw line segment P(tL) to P(tU). Step 13 : Stop. 

Explain midpoint subdivision line clipping algorithm.

Description : Explain midpoint subdivision line clipping algorithm.

Last Answer : Step 1: Scan two end points for the line P1(x1, y1) and P2(x2, y2). Step 2: Scan corners for the window as (Wx1, Wy1) and (Wx2, Wy2). Step 3: Assign the region ... through 5 for both subdivided line segments until you get completely visible and completely invisible line segments. Step 6: Exit.

Explain scan line algorithm of polygon clipping.

Description : Explain scan line algorithm of polygon clipping.

Last Answer : For each scan line crossing a polygon, the area-fill algorithm locates the intersection points of the scan line with the polygon edges. These intersection points are then sorted from left to right ... 4 : Fill all those pair of coordinates that are inside polygons and ignore the alternate pairs.

Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Description : Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Last Answer : LRU: The Least Recently Used (LRU) page replacement policy replaces the page that has not been used for the longest period of time. LRU replacement associates with each page the time of that page's last use. ... in question so assume frame size as 3 or 4) LRU: Assume frame size=3