sci.crypt
  Home FAQ Contact Sign in
sci.crypt only
 
Advanced search
November 2006
motuwethfrsasuw
  12345 44
6789101112 45
13141516171819 46
20212223242526 47
27282930    48
2006
 Jan   Feb   Mar   Apr 
 May   Jun   Jul   Aug 
 Sep   Oct   Nov   Dec 
2008 2007 2006  
total
sci.crypt Profile…
RELATED GROUPS

POPULAR GROUPS

 Up
  Re: Some good faith [LTC manuals]         


Author: mm
Date: Nov 2, 2006 18:20

Tom St Denis a écrit :
> As a way to bury the hatchet and do something nice I'm offering a free
> printed copy of the LTC manual [signed] to the first 5 (to celebrate
> the # of years the project has been going) people to send me an email
> with a short snippet of their interest in the LT projects [will remain
> private if desired].
>
> For those who haven't been to my website, I'm offering printed copies
> of the LTC manual for sale as a way to fund some of the projects I do.
> The source of the manual will remain PUBLIC DOMAIN as part of the
> archive. The printing is mostly to provide nice printed manuals for
> those that work with the library and to raise funds. Since attending
> conferences [and providing stipends] and buying hardware costs money it
> would be nice if I wasn't fronting all of the costs. I also plan on
> bringing copies to the conferences I attend next year as freebies.
>
> I'm waiting on the first draft print [from lulu.com] to examine the
> quality of the process. I'm sure it's going to be fine (they're in
> business for a reason I imagine). At which point I will edit, refine
> and add to the manual for the first printing. ...
Show full article (1.72Kb)
no comments
  Re: TomsFastMath v0.10 released         


Author: Wolfgang Ehrhardt
Date: Nov 2, 2006 09:04

On 1 Nov 2006 06:47:02 -0800, "Tom St Denis" gmail.com>
wrote:
>I've released v0.10 of TomsFastMath (TFM), new features include
>
>- Fix for fp_sqr_comba() in ISO C mode
>- Added support for the Atmel AVR32
>- Added [untested] PPC64 support
>- Added support for easy unrolling for ECC curve sizes
>- Fixed a bug in fp_radix_size()
>
>http://tfm.libtomcrypt.com
>
>Quick summary: TFM is a free open source public domain math library
>that was designed solely for fast and portable RSA and ECC (prime
>field) mathematics. It is a port of LibTomMath with several key
>changes in mind.

Is there any specific reason why TFM uses a simple Euclidian gcd
(without special fast mod implementation) and not at least the binary
gcd from standard LTM (not to mention faster algorithms)?
Show full article (1.04Kb)
1 Comment
  International Company Now Hiring-7429         


Author: 99kennel
Date: Nov 2, 2006 07:13

International Company Now Hiring.

Get paid to Give Away FREE Info Packs.

Earn $1 for every free info pack you give away!

Start earning today!

http://www.typeinternational.com/idevaffiliate/idevaffiliate.php?id=7429_70_3_10...
no comments
  Re: Securing ARC4         


Author: Francois Grieu
Date: Nov 2, 2006 05:02

In article <1162419350.428383.148240@h48g2000cwc.googlegroups.com>,
"Bill Cox" billrocks.org> wrote:
> I was thinking that for really large files, I could break them
> into reasonable sized chunks, such as 64 or 128 K bytes, which
> would be compressed and encrypted separately.

One problem with combined compression+encryption is that the
compressio ratio is not hidden, and leaks information on the
plaintext that can be useful to an attacker (e.g. is the
plaintext mp3 or bitmap, did the content of the database
relative to entry known to be stored at that location grow).

François Grieu
no comments