Key Pages
- |Changes [Feb 26, 2009]
The camera
Cryptography
The field of study that cryptography is a part of is called cryptology.
Cryptography: is the making of a cipher system and the breaking of a cipher system and is called cryptanalysis. The main thrust of cryptography uses two general scrambling techniques:
1. Transposition: where each symbol maintains its identity but changes its position and substitution, where each symbol maintains its position but changes its identity.
2. Modern cryptography also consists of Asymmetrical Techniques: where for a given encryption key the corresponding decryption key is different. Unfortunately, there does not exist a mathematical proof for security, thus it is currently impossible to achieve absolute security. Proof of security is usually reduced to some other problem known to be extremely difficult to solve, such as the factorization of large numbers.
There exist three fundamental parts to the encryption/decryption process: the message, a key, and an algorithm. Currently, as per Kerckhoff's Principle, the algorithm can be disclosed to the public, but keeping the key secret during actual encryption and decryption of a message is the most significant aspect to effective cryptography. One of the challenges of maintaining secure communications is key management. As the number of users and messages increase the more keys are used, thus increasing the chance of making mistakes or exposing patterns and vulnerabilities. Security requires four fundamental services integrity, confidentiality, authentication and non-repudiation.
Security attacks can be either passive, such as eavesdropping or active, such as modifying a message, and exist in four general categories interruption, interception, modification and fabrication.
Cryptography requires problems that are computationally hard so that scrambled messages are hard to break without the correct key. Checking whether or not a key is correct is easily verifiable, which might suggest that cryptographic problems are class NP problems. However, cryptographic strength does not relate to NP-complete problems because NP-complete problems deal with difficulty in the worst case, which means that the problem may be easily solvable in all other cases. Complexity for cryptography requires analyzing best case solutions, such that a candidate for a cipher system would be difficult in the best case to solve, thus not being concerned with worst case complexity. Hence, a cipher system requires that average case complexity needs to be difficult, to achieve a cipher system that is practically unbreakable.