Difference between revisions of "Cryptography"
From MgmtWiki
(→Problems) |
(→Problems) |
||
Line 10: | Line 10: | ||
==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 | + | * 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== |
Revision as of 09:14, 25 April 2021
Full Title
General resource site for Cryptography.
Context
- Cryptography originally meant 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.
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.
Resources
- Bill's crypto page has a broad list of crypto methods.