Cryptography in C and C++Apress, 22. nov. 2006 - 504 strani CRYPTOGRAPHY IS AN ANCIENT ART, well over two thousand years old. The need to keep certain information secret has always existed, and attempts to preserve secrets have therefore existed as well. But it is only in the last thirty years that cryptography has developed into a science that has offered us needed security in our daily lives. Whether we are talking about automated teller machines, cellular telephones, Internet commerce, or computerized ignition locks on automobiles, there is cryptography hidden within. And what is more, none of these applications would work without cryptography! The historyofcryptographyoverthepastthirtyyearsisauniquesuccessstory. The most important event was surely the discovery of public key cryptography in the mid 1970s. It was truly a revolution: We know today that things are possible that previously we hadn’t even dared to think about. Dif?e and Hellman were the ?rst to formulate publicly the vision that secure communication must be able to take place spontaneously. Earlier, it was the case that sender and receiver had ?rst to engage in secret communication to establish a common key. Dif?e and Hellman asked, with the naivety of youth, whether one could communicate secretly without sharing a common secret. Their idea was that one could encrypt information without a secret key, that is, one that no one else could know. This idea signaled the birth of public key cryptography. That this vision was more than just wild surmise was shown a few years later with the advent of the RSA algorithm. |
Iz vsebine knjige
Zadetki 1–5 od 31
Stran xxii
Prikaz vsebine te strani ni dovoljen.
Prikaz vsebine te strani ni dovoljen.
Stran 6
Prikaz vsebine te strani ni dovoljen.
Prikaz vsebine te strani ni dovoljen.
Stran 19
Prikaz vsebine te strani ni dovoljen.
Prikaz vsebine te strani ni dovoljen.
Stran 68
Prikaz vsebine te strani ni dovoljen.
Prikaz vsebine te strani ni dovoljen.
Stran 69
Prikaz vsebine te strani ni dovoljen.
Prikaz vsebine te strani ni dovoljen.
Vsebina
The Representation of Large Numbers in C | 13 |
Calculating with Residue Classes | 67 |
Modular Exponentiation | 81 |
Bitwise and Logical Functions | 125 |
Input Output Assignment Conversion | 145 |
Dynamic Registers | 157 |
Basic NumberTheoretic Functions | 167 |
A Successor to the Data Encryption Standard | 237 |
Test LINT | 286 |
317 | 319 |
Approaches for Further Extensions | 417 |
B Directory of C++ Functions | 433 |
Macros | 451 |
Calculation Times | 459 |
465 | |
473 | |
Druge izdaje - Prikaži vse
Pogosti izrazi in povedi
addition algorithm application argument arithmetic base binary digits BITPERDGT block byte calculation called carry Chapter CLINT a_l CLINT object common computed congruence consider const LINT& contains cpy_l defined determined developed difference digits DIGITS_L division divisor E_CLINT E_CLINT_OK elements encryption error example exist exponent exponentiation factors FLINT/C function given implementation initialization Input integer leading length LINT LSDPTR means memory method modular modulo Montgomery multiplication natural numbers number of digits obtain operator otherwise output overflow passed pointer position possible prime prime numbers problem procedure properties random number reduction registers remainder representation represented residue result round sequence shift square square root standard step stored Syntax Table ULONG unsigned USHORT variable void zeros