A. Secret key and private key
B. Private key and public key
C. Public key and secured key
D. Secured key and private key
Explanation: In asymmetric key cryptography, each user needs to have 2 keys; one is public and another one is private key. Public key is used for encryption, private is used for decryption.
A. Rivest, shamir, aldleman
B. Routest, shamir, adem
C. Robert, shamuel, alice
D. Radmir, shadhur, alice
Explanation: RSA algorithm is a public key algorithm, which was discovered at M.I.T in 1978. It is very strong but the only disadvantage is, it requires more key length in order to provide more security.
A. Rsa algorithm
B. Aes algorithm
C. 3des algorithm
D. Knapsack algorithm
Explanation: Knapsack is the first public key algorithm, that was not that much secured and now it is not in use. Knapsack is the founding algorithm for further algorithms in public key cryptography.
A. Uses different keys
B. Every user has a unique private key
C. Public key can be same for number of users
D. Cannot deduce private key from public key
Explanation: There will be a unique public key for every user, who publishes it. Public key prevents spoofing, by acting as the receiver. Sender uses the public key of the receiver to encrypt the message and the receiver will decrypt the message with his secret key.
A. Rsa, eigamal, elliptic curve cryptography
B. Elliptic curve, rsa
C. Rsa, eigamal
D. Eigmal, rsa
Explanation: RSA is the initial one and it achieves security using factoring of huge numbers. EIGamal uses numbers module p to strengthen the algorithm. Elliptic curve scheme uses discrete logarithms to achieve security.
A. It is efficient for decryption
B. Lengthy keys are required for more security
C. It is not efficient for encryption
D. It is not popular
Explanation: RSA schemes need at least 1024 bits in a key for providing good level of security. Symmetric key cryptography uses 128 bits. The more the key length, more the security in RSA, this is why RSA slows down the system.
A. Des
B. Aes
C. Rc4
D. Rsa
Explanation: RSA is named with the first letters of the discoverers (Rivest, Shamir, Aldleman). It uses lengthy keys for security and uses the concept of factoring large numbers to be secured.
A. Used over rsa
B. Uses elliptic curve theory
C. Key length is larger than rsa
D. Uses discrete logarithms
Explanation: Elliptic curve cryptography is much faster and efficient than RSA algorithm. And keys are smaller in size, which are generated by elliptic curve equation.
A. No need of key distribution
B. Security
C. Using digital signatures
D. Used to decrypt small messages
Explanation: Public key cryptography cannot deal well with bulk messages. It uses very lengthy keys compared to symmetric key cryptography; this makes the system slow to proceed with bulk messages.
A. True
B. False
C.
D.
Explanation: A sender can make use of pubic directory to acquire the public key of the recipient. After acquiring the public key of the receiver, sender will encrypt the message using receiver public key. If sender encrypts the message with his own secret key, then only the sender can decrypt it.