A direct operation playing a major part in current cryptography involves multiplying together two large numbers. Is generally far more difficult to solve, and there may not be a unique answer. They share the basic features of both: the inverse problem Coding and decoding - or in Greek terminology, cryptography and cryptanalysis - are perfect examples of direct and inverse problems. Mathematicians are fond of this joke (whose punch line is below) is that it is a perfect example of an ''inverse problem,'' one that arises when one knows the outcome of some process and needs toĭeduce what led to it. Very old joke - one that does not quite work in written form - goes, ''If 9W is the answer, what is the question?'' One reason Simon Singh traces the history of code making and code breaking.
0 kommentar(er)
