Discussion is right way to get Solution of the every assignment, Quiz and GDB.
We are always here to discuss and Guideline, Please Don't visit Cyberian only for Solution.
Cyberian Team always happy to facilitate to provide the idea solution. Please don't hesitate to contact us! NOTE: Don't copy or replicating idea solutions. Quiz Copy Solution Mid and Final Past Papers Live Chat
Although symmetric key cryptography makes use of only one key, asymmetric key cryptography, also known as public key cryptography, utilizes two keys: a public key and a private key. The public key is used to encrypt data sent from the sender to the receiver and is shared with everyone.
Public and Private Key Concept in Encryption
Secret key cryptography (symmetrical encryption): Both the sender and receiver must use the same key to encrypt and decrypt messages being sent. This imposes a security risk as we need to deliver the key to the recipient of the message in a secure way to make him/her able to decrypt the message. If an intruder gets hold of the key somehow, he/she will be able to decrypt the secret message and thus compromise the whole operation.
Public key cryptography (asymmetrical encryption): In this method we use two keys, one for encryption and the second for decryption. A user will use his/her friend’s public key to encrypt the message. The receiver will use a private key (which should be kept secret) in order to decrypt this message when needed. The public key is used to encrypt plain text or to verify a digital signature, whereas the private key is used to decrypt cipher text or to create a digital signature. Messages encrypted with the public key can only be decrypted using the associated private key pair.
Question No 02: (Marks: 10)
You are required to calculate (Step by Step) the worst case time complexity T(n) of the algorithm designed in Question No. 01.
Question No. 02: The step by stem analysis of the algorithm designed in question 1 is as follow,
The time taken by each statement (step) is given as follows,
Step 1: C1 // Execute only 1 time or Constant Time or O (1)
Step 2: C2 // Execute only 1 time or Constant Time or O (1)
Step 3: n -2 // Execute n -2 times
Step 4: n -2 // Execute n -2 times
Step 5: n – 2 // Execute n -2 times
Step 6: C3 // Execute only 1 time or Constant Time or O (1)
Step 7: C4 // Execute only 1 time or Constant Time or O (1)
Step 8: C5 // Execute only 1 time or Constant Time or O (1)
Step 9: C6 // Execute only 1 time or Constant Time or O (1)