$include_dir="/home/hyper-archives/boost/include"; include("$include_dir/msg-header.inc") ?>
From: Trevor Perrin (tperrin_at_[hidden])
Date: 2001-04-28 15:57:37
 
crypto++ (http://www.eskimo.com/~weidai/cryptlib.html) is also a very good
free class library of "cryptographic schemes" (symmetric and public-key
algorithms, hashes, random number generation, "algebraic structures",
compression and text encoding, etc..).
-----Original Message-----
From: Gerhard Wesp
To: boost_at_[hidden]
Cc: Gerhard Wesp
Sent: 4-28-01 5:58 AM
Subject: [boost] Interest in cryptographic algorithms?
Good afternoon,
I have an implementation of Rijndael, the new AES 
(http://csrc.nist.gov/encryption/aes/) and would gladly contribute it to
boost if there is interest (and the necessary changes aren't too much
work :-).  
Currently, the interface basically looks like:
 
struct rijndael {
  // 8 bit and 32 bit unsigned types; modify the definition if
  // necessary!
  typedef unsigned char byte ;
  typedef unsigned int word ;
  // block_length is in bits and must be 128, 192, or 256
  //
  // key.size() must be 16, 24, or 32, corresponding to 128, 192, or 256
  // key bits.  The number of key bits is independent of the block
  // length!
  //
  // Note that in the AES draft standard as of March 2001, only 128 bit
  // data blocks are allowed.
  rijndael( unsigned block_length , std::vector< byte > const& key ) ;
  // the destructor clears sensitive data before releasing the memory
  ~rijndael() ;
  // encryption and decryption works with in-place buffers
  void encrypt( std::vector< byte >& buffer ) const ;
  void decrypt( std::vector< byte >& buffer ) const ;
  // ...
} ;
The implementation can be downloaded from my homepage, 
  http://www.cosy.sbg.ac.at/~gwesp/
I'm looking forward to your comments!
best regards,
-g
-- Afgrnd der Ensparngsmassnhmen bei den Onlne-Kostn ist ab sfort in jedm Wrt von mhr als dri Buchstabn mindestns ein Vkal wegzlassn. To unsubscribe, send email to: <mailto:boost-unsubscribe_at_[hidden]> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/