Public Key Cryptography in Sensor Networks - Assignment Example

Quiz 6: Public Key QUIZ 6: PUBLIC KEY Private Key is an encryption/ decryption key known to the party or parties thatexchanges messages (In a networking field).Public Key does some designed authority as an encryption key that, combines with a private key derived from a public key can be used to encrypt messages effectively, and digital signatures provide n value (Gaubatz, Kaps, & Sunar,2005). RSA entails a public key algorithm that generates two keys; they allow encryption of the data, whereby one is decrypted with the other. Adleman Adi Leonard and Shamir Rivest Ai pioneered the key. Question 1 1.1. Using n (n − 1)/2 N=300 users Replacing n with 300 300(300-1)/2 300(299)/2= (299*300)/2keys 89700/2=44850keys Reason assume that n users are in a network while the other two are intending to create a communication process. It means that the user should have securely to store n−1 different symmetrical keys for each user. The aggregate result may be obtained as follows n (n − 1)/2 key (Gaubatz, Kaps, & Sunar, 2005). 1.2 False it is false because Cryptography public key utilizes a different key when decrypting and another one during encryption to solve distribution challenges. For example, if Bob and Alice focus to initiate communication among them, the two parties must provide each other their public key that they utilize. Further, Alice may execute encryption on her message and send her information to Bob using the public key that is being used by Bob. Knowing that only Bob, the possessor of Bob’s private key, can decrypt information provided. On the other hand, Bob should initiate encryption of his message using Alice Public key to making communication effective. It is imperative to note that Public keys can secure storage space in a database in order ensure the keys do not have to be. Not only does public key cryptography solve critical Security: Cryptographic communication and authentication distribution. Moreover, it addresses the barrier of getting [n (n-1)]/2 keys that emerge from users n (Gaubatz, Kaps, & Sunar, 2005). Therefore, we only need 2n keys (n public and n private). 1.3 False It can be that when the encryption key being utilized has discrepancies with the decryption key, it implies that one is using a public key algorithm. A good example of such key is the RSA. Further, it may not be possible to compute description Key may not within the reasonable period. It means that the encryption key is made public and, therefore, the origin of the name public key algorithm. It implies that a stranger or an authorized access may encrypt the data/the message but only the decryption key holder is the only person who can execute message decryption. It is imperative to note that, for digital signals implementation, it is possible to encrypt the message using the private key and decrypt it using the public key. However, the person decrypting the message using the public key should be aware that private key processor could encrypt the message (Gaubatz, Kaps, & Sunar, 2005). RSA only generate the private key; this is because the public key is not providing a place for storage. However, it is possible to compute the private key while utilizing the RSA as discussed. Therefore, PHI is part of the private key. E is part public key because is the one that will be for encryption and does not require to be stored. 1.5 True. It can be observed that section key generated and Further it is imperative to note that when made public it is possible find the value 1.6.1 Size of data=3,000,000 bytes Data Encryption Standard (DES) speed= 1,000,000 bytes per second. Speed= size of data/time Therefore, time taken to encrypt=size of data/speed=3000000/1000000 Time of encryption= 3 seconds. RSA is 100 times slower than DES There it to 3 * 100sec=300seconds Now encryption speed of RSA=data size/time Speed =3000000/300=10000bytes per second 1.6.2 It will take Alice 300 seconds to encrypt this message as from the answer in 1.6.1 above Size of data=3,000,000 bytes Data Encryption Standard speed= 1,000,000 bytes per second. Speed= size of data/time Therefore, time taken to encrypt=size of data/speed=3000000/1000000 Time= 3 sec. RSA is 100 times slower than DES There it to 3 * 100sec=300sec 1.6.3 Security risk Alice has provided her private key to Bob. It is a risk because a single person to decrypt her messages should only use the private key. Alice may receive a confidential message that requires her only to decrypt, but Bob have that key also and can decode Alice’s messages (Gaubatz, Kaps, & Sunar, 2005). 1.6.4 Solution They should create a new random key each time they need a conversation channel. This decreases the amount of data that they encrypt with their primary keys. It hence decreases an intruder’s chance of collecting enough statistically significant information necessary for describing the primary keys. In addition, RPC depends on the access to private key database access and private user key. The authentication sequences may be continued by utilizing the subscript notation to denote the encryption. When they mention a user’s name, they refer to a network name. The mention name involves the user operating system ID and system domain name. Further, clocks on client and server must be synchronized to ensure that the system work correctly (Al-Riyami, & Paterson, 2003). Question 2: Symmetric algorithm keys entail cryptography keys that utilize similar that use the same cryptographic keys when execution encryption on a blank text as well as decrypting of the cipher text. The Fundamental discrepancies s between Symmetric-key cryptosystems and public key cryptosystems may be discussed as follows. I. Symmetric key cryptography is as shared key cryptography. As the name suggests, it involves two users who utilize similar private key during information encryption and decryption. On the contrary, cryptography public key requires the discrepancy that arises when two different key are. It implies that the public key is applied in data encryption while the private one is in data decryption (Al-Riyami, & Paterson, 2003). II. It can be that symmetric key cryptography uses the same key for both decryption and encryption. Based on the research observation, symmetric key has higher speed and more efficient to implement. Research shows that symmetric key requires less processing power and hence making it more suitable to use. On the contrary, cryptography public key tend to be lower because it uses two keys one in encrypting data while the remaining is for data decryption. However, but is more secure than symmetric key cryptography (Al-Riyami, & Paterson, 2003). References Al-Riyami, S. S., & Paterson, K. G. (2003). Certificate less public key cryptography. In Advances in Cryptology-ASIACRYPT 2003 (pp. 452-473). Springer Berlin Heidelberg. Gaubatz, G., Kaps, J. P., & Sunar, B. (2005). Public key cryptography in sensor networks—revisited. In Security in Ad-hoc and Sensor Networks (pp. 2-18). Springer Berlin Heidelberg. Read More