Re: practical question
From: Barry Margolin (barmar_at_alum.mit.edu)
Date: 03/06/05
- Next message: Barry Margolin: "Re: i need some good advice, my boss is reading my emails"
- Previous message: Ross: "Re: i need some good advice, my boss is reading my emails"
- In reply to: alexk: "practical question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 05 Mar 2005 22:07:38 -0500
In article <1110047298.444715.12460@z14g2000cwz.googlegroups.com>,
"alexk" <alexk@mailinator.com> wrote:
> Hi,
> Out of curiosity. When you have an encryption, say rsa, where
> you have to take a message, and raise it to some power modulu something
> - how
> it is practicaly implemented? It's surely impractical to treat the
> whole message/file as a huge number and then try to raise it to some
> power - for example, with crc16/32, I have a table, and I can
> iteratively go byte-byte, updatiing the CRC, so how it is done with
> encryption ?
Public-key encryption algorithms like RSA are usually not used to
encrypt long messages. Symmetric algorithms like DES and AES are used
for this. A random key is chosen for this step, and the public-key
mechanism is used to distribute the key.
-- Barry Margolin, barmar@alum.mit.edu Arlington, MA *** PLEASE post questions in newsgroups, not directly to me ***
- Next message: Barry Margolin: "Re: i need some good advice, my boss is reading my emails"
- Previous message: Ross: "Re: i need some good advice, my boss is reading my emails"
- In reply to: alexk: "practical question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|