Hybrid cryptosystem: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Caesar Schinas
m (Robot: Changing template: TOC-right)
imported>Sandy Harris
No edit summary
Line 13: Line 13:
The steps for Alice are:
The steps for Alice are:


* generate a random key (call it K) for the symmetric cipher, using a good [[random number]] generator
* generate a random key (call it K) for the symmetric cipher, using a good [[random number generator]]
* encrypt the actual message with a block cipher, using K as the key
* encrypt the actual message with a block cipher, using K as the key
* encrypt K with the public key system
* encrypt K with the public key system

Revision as of 21:37, 29 November 2009

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

Hybrid cryptosystems combine public key (asymmetric) cryptography with secret key (symmetric) techniques such as block ciphers or stream ciphers. The public key techniques provide source authentication and key management services while the symmetric techniques do the high-volume data encryption. Cryptographic hashes are also involved, providing data integrity protection.

For the Internet, there are a number of security systems — PGP for email, TLS for the web, SSH for remote login, IPsec as a general protection mechanism, and DNS security. All are hybrid cryptosystems that use symmetric ciphers (block ciphers or stream ciphers) along with public key methods and cryptographic hashes. All require a source of cryptographic quality random numbers.

RFC 3766 has guidance on choosing appropriate key sizes for the public key algorithms in hybrid systems, to match the strength of other algorithms.

Take PGP as an example. If Alice wants to securely send a message to Bob, she cannot just use a symmetric method without first securely delivering the key to him. Securely delivering a key is not a trivial problem; anything sent over the net might be monitored, phones might be tapped and so on. Bob might be some distance away and sending an officer with a briefcase handcuffed to his wrist is often impractical.

If she can get Bob's public key and verify that it is valid, she can securely send a message using a public key system. However, such systems are generally much slower than symmetric methods; using them for large messages is expensive. In PGP, therefore, the public key technique is used only to provide authentication and to manage keys for a block cipher. This takes care of the key distribution problem, and the block cipher does the rest.

The steps for Alice are:

  • generate a random key (call it K) for the symmetric cipher, using a good random number generator
  • encrypt the actual message with a block cipher, using K as the key
  • encrypt K with the public key system
  • package the encrypted message, the encrypted K, and some authentication data into a PGP message
  • send it off to Bob

Bob checks the authentication data, does a public key decryption to get K, then uses K to decrypt the actual message.