Difference between revisions of "Assign physical meaning to data"
Jump to navigation
Jump to search
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
The act of organizing human agencies, supply chains, or computer architectures, either classical or quantum computers, are ways to assign physical meaning to data. Designing hard-to-decypher encryption algorithm is one way to associate physical meaning to data. The complexity required to decypher encrypted messages are often designed to be so astronomically high, something like <math>2^10000</math><ref>{{:Book/Understanding Cryptography}}</ref> order of magnitude, which makes even the fastest super computers to be conceivable into the future difficult to crack the code. | The act of organizing human agencies, supply chains, or computer architectures, either classical or quantum computers, are ways to assign physical meaning to data. Designing hard-to-decypher encryption algorithm is one way to associate physical meaning to data. The complexity required to decypher encrypted messages are often designed to be so astronomically high, something like <math>2^{10000}</math><ref>{{:Book/Understanding Cryptography}}, Section 2.2.2, Page 36</ref> order of magnitude, which makes even the fastest super computers to be conceivable into the future difficult to crack the code. | ||
<noinclude> | <noinclude> | ||
Latest revision as of 10:50, 24 July 2022
The act of organizing human agencies, supply chains, or computer architectures, either classical or quantum computers, are ways to assign physical meaning to data. Designing hard-to-decypher encryption algorithm is one way to associate physical meaning to data. The complexity required to decypher encrypted messages are often designed to be so astronomically high, something like [1] order of magnitude, which makes even the fastest super computers to be conceivable into the future difficult to crack the code.
References
- ↑ Paar, Christof; Pelzl, Jan (2010). Understanding Cryptography. local page: Springer. ISBN 978-3-642-04101-3. , Section 2.2.2, Page 36
Related Pages