Difference between revisions of "Cryptography"
From MgmtWiki
(→Problems) |
(→Context) |
||
(9 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
==Full Title== | ==Full Title== | ||
− | General resource site for [[Cryptography]]. | + | General resource site for [[Cryptography]], Greek for secret writing. |
==Context== | ==Context== | ||
− | * [[Cryptography]] | + | * [[Cryptography]] literally means Secret Writing and was use by Caesar in his communications from the Gallic wars. Since then, it has become a category of mathematics dealing with methods that are easy to invoke and difficult to discover. Commercial [[Cryptography]] is involved in: |
# protecting data from disclosure (its original purpose) and | # protecting data from disclosure (its original purpose) and | ||
# assuring the source or integrity of messages. | # assuring the source or integrity of messages. | ||
* Specific details are on the wiki pages [[Secret Key Cryptography]] and [[Public Key Cryptography]]. | * Specific details are on the wiki pages [[Secret Key Cryptography]] and [[Public Key Cryptography]]. | ||
+ | * Often abbreviated as just crypto. | ||
==Problems== | ==Problems== | ||
* Cryptography is hard math that deals with the solution of hard problems. It is not a topic that can be addressed by programmers looking for simple solutions with a limited time budget. | * Cryptography is hard math that deals with the solution of hard problems. It is not a topic that can be addressed by programmers looking for simple solutions with a limited time budget. | ||
+ | * As mathematicians and computer architects continue to explore solutions space the hard problems of cryptography are found to have simpler solutions. The continued success of the attempts to solve hard problems results in a continued effort to find new hard problems that can replace those that have been solved. | ||
+ | * The impact of this constant churn in the list of hard problems is a similar churn in the cryptographic algorithms that are accepted as computationally secure. | ||
==Solutions== | ==Solutions== | ||
− | Most programmatic solutions are not sufficiently robust to fend off attacks by determined adversaries. | + | * Most programmatic solutions are not sufficiently robust to fend off attacks by determined adversaries. Bugs and new attacks are a fact of life. |
+ | * Thus any solution that depends on cryptography for security must be designed to allow new algorithms to be swapped out as old ones are solved or bugs are discovered. | ||
==Resources== | ==Resources== | ||
* [https://asecuritysite.com/encryption/ Bill's crypto page] has a broad list of crypto methods. | * [https://asecuritysite.com/encryption/ Bill's crypto page] has a broad list of crypto methods. | ||
+ | * The core proof is describe on the wiki page [[Indistinguishability Obfuscation]]. | ||
[[Category: Glossary]] | [[Category: Glossary]] | ||
+ | [[Category: Cryptography]] | ||
[[Category: Proof]] | [[Category: Proof]] |
Latest revision as of 17:07, 8 January 2022
Full Title
General resource site for Cryptography, Greek for secret writing.
Context
- Cryptography literally means Secret Writing and was use by Caesar in his communications from the Gallic wars. Since then, it has become a category of mathematics dealing with methods that are easy to invoke and difficult to discover. Commercial Cryptography is involved in:
- protecting data from disclosure (its original purpose) and
- assuring the source or integrity of messages.
- Specific details are on the wiki pages Secret Key Cryptography and Public Key Cryptography.
- Often abbreviated as just crypto.
Problems
- Cryptography is hard math that deals with the solution of hard problems. It is not a topic that can be addressed by programmers looking for simple solutions with a limited time budget.
- As mathematicians and computer architects continue to explore solutions space the hard problems of cryptography are found to have simpler solutions. The continued success of the attempts to solve hard problems results in a continued effort to find new hard problems that can replace those that have been solved.
- The impact of this constant churn in the list of hard problems is a similar churn in the cryptographic algorithms that are accepted as computationally secure.
Solutions
- Most programmatic solutions are not sufficiently robust to fend off attacks by determined adversaries. Bugs and new attacks are a fact of life.
- Thus any solution that depends on cryptography for security must be designed to allow new algorithms to be swapped out as old ones are solved or bugs are discovered.
Resources
- Bill's crypto page has a broad list of crypto methods.
- The core proof is describe on the wiki page Indistinguishability Obfuscation.