• The concept of key range and key-size are related to each other. Key Range is total number of keys from smallest to largest available key. An attacker usually is armed with the knowledge of the cryptographic algorithm and the encrypted message, so only the actual key value remains the challenge for the attacker.
• If the key is found, the attacker can get original plaintext message. In the brute force attack, every possible key in the key-range is tried, until we get the right key.
• In the best case, the right key is found in the first attempt, in the worst case, the key is found in the last attempt. On an average, the right key is found after trying half of the possible keys in the key-range. Therefore by expanding the key range to a large extent, longer it will take for an attacker to find the key using brute-force attack.
• The concept of key range leads to the principle of key size. The strength of a cryptographic key is measured with the key size
• Key size is measured in bits and is represented using binary number system. Thus if the key range from 0 to 8, then the key size is 3 bits or in other words we can say if the size is bits then the key range is 0 to 256. Key size may be varying, depending upon the applications and the cryptographic algorithm being used, it can be 40 bits, 56 bits, 128 bits & so on. In order to protect the cipher-text against the brute-force attack, the key-size should be such that the attacker can not crack it within a specified amount of time.
• From a practical viewpoint, a 40-bit key takes about 3 hours to crack, however a 41-bit key would take 6 hours and 42-bit key would take 12 hours & so on. This means every additional bit doubles the amount of time required to crack the key. We can assume that 128 bit key is quite safe, considering the capabilities of today’s computers. However as the computing power and techniques improve, these numbers will change in future.
Explain the concept of Key Range and Key Size
feel free to contact us info@mybscit.com
-
IDEA Algorithm
Web Master, , Network Security, atul kahate notes network security, idea algorithm, idea algorithm in network security, mumbai university tybscit notes, tybscit network security notes, 0
IDEA – International Data Encryption Algorithm. It is patent protected to prevent fraud and privacy.It was meant to be a...
-
Confidentiality in Network Security
Kaushik Kini, , Network Security, atul kahate notes network security, confidentiality in network security, network security notes, tybscit network security confideniality, 0
The principle of confidentiality specifies that only the sender and intended recipient should be able to access the...
-
Authentication in Network Security
Kaushik Kini, , Network Security, atul kahate notes network security, Authentication in network security, network security notes, tybscit network security Authentication, 0
Authentication mechanism helps to establish proof of identity. This process ensures that origin of an electronic document or message...
-
Explain Pharming. (DNS Spoofing)
Kaushik Kini, , Network Security, atul kahate notes network security, DNS Spoofing, explain DNS Spoofing, Explain Pharming, network security notes, tybscit network security, tybscit network security DNS spoofing, tybscit network security Pharming, 0
DNS spoofing also known as pharming attack. As we know, using the Domain Name System (DNS), people can identify...
-
What are the different types of criminal attacks?
Kaushik Kini, , Network Security, atul kahate notes network security, network security notes, tybscit network security types of criminal attacks, types of criminal attacks in network security, 0
Fraud:- Modern fraud attacks concentrate on manipulating some aspects of electronic currency, credit cards, electronic stock certificates, checks, letters...
-
Rail Fence Algorithm
Web Master, , Network Security, atul kahate notes network security, network security notes, Rail Fence, Rail Fence Algorithm, Rail Fence Algorithm in network security, tybscit network security, tybscit network security Rail Fence Algorithm, 0
Rail fence cipher The rail-fence technique is an example of transposition technique. It uses a simple algorithm. Steps...
-
Non-repudiation
Kaushik Kini, , Network Security, atul kahate notes network security, network security notes, Non-repudiation, Non-repudiation in network security, tybscit network security Non-repudiation, 0
There are situation where a user sends a message, and later on refuses that he had sent that message...
-
Simple columnar- transposition technique
Web Master, , Network Security, atul kahate notes network security, download bscit notes of Mumbai University, network security notes, network security notes for tybscit semester 5, Simple columnar transposition technique, 0
Simple columnar transposition technique is an example of transposition technique. Steps for Simple columnar transposition technique are as follow....
Green Computing Book
C++ Interview Questions
Categories
- Advance Java (15)
- Advance Sql (8)
- ASP.NET with C# (16)
- Computer Graphics (3)
- Cyber Law (22)
- Digital Electronics 16-17 (2)
- Fybscit Semester 1 (1)
- FYBSCIT Semester 1 Question Bank (2)
- Fybscit Semester 2 (1)
- Imperative Programming (6)
- Linux Administration (3)
- Unit 1 (3)
- Network Security (33)
- News (40)
- Posts (1)
- Professional Communication Skills (2)
- Project (1)
- Project Management (1)
- Software Testing (1)
- Tybscit Question Papers (11)
- Semester V (7)
- Semester VI (4)
Recent Posts
- TYBSCIT Semester 5 Question Paper and Solution November 2017 (C75:25)
- TYBSCIT Semester 5 Exam Dates of October 2017 CBSGS 75:25 Postponed
- Tybscit Semester 5 Question Paper & Solutions November 2016 (75:25)
- FYBSCIT Semester 1 Question Paper & Solutions – October 2016 (75:25)
- FYBSCIT Semester 2 Question Paper & Solutions – March 2017
Recent Comments
- Web Master on JSplitPane Example in Advance java – Tybscit Semester 5
- priya on JSplitPane Example in Advance java – Tybscit Semester 5
- Web Master on TYBSCIT Semester V KT Results Announced April 2016
- Web Master on TYBSCIT Semester V KT Results Announced April 2016
- Web Master on Question Bank for Operating System fybscit semester 1