[80780] in Cypherpunks

home help back first fref pref prev next nref lref last post

Re: CRACKIT.DAT increased to 50,000 bytes.

daemon@ATHENA.MIT.EDU (Igor Chudov @ home)
Wed May 28 04:14:14 1997

To: DataETRsch@aol.com
Date: Tue, 27 May 1997 22:37:28 -0500 (CDT)
Cc: 3umoelle@informatik.uni-hamburg.de, cypherpunks@toad.com
In-Reply-To: <970527175002_2019806503@emout15.mail.aol.com> from "DataETRsch@aol.com" at May 27, 97 05:52:45 pm
From: ichudov@algebra.com (Igor Chudov @ home)
Reply-To: ichudov@algebra.com (Igor Chudov @ home)

Jeremy,

I must commend you for your helpfulness and cooperation. Not being a
professional cryptographer, I believe that your algorithms are not
very strong, but I will be happy if you and others prove me wrong. 

Actions such as yours inspire trust in the cryptographic software
that you write, if it passes the review.

Thank you.

	- Igor.

DataETRsch@aol.com wrote:
> 
> In a message dated 97-05-26 19:38:43 EDT, you write:
> 
> << The test file is only 836 bytes long.  Could you please post a file
>  consisting of, say, 50.000 space characters encrypted with the same
>  key? >>
> 
> 50,000 with the same key? Sure. A new file will be posted under the same name
> as the previously posted one. The same key will be used to encrypt the file
> before posting. Contest details will be reposted. By the way, a simple
> VSA2048 decryption program will be released soon so that there will not exist
> a need to develop one to decrypt the file. Also, the contest expiration date
> has been extended to July 1st, 1997. Good luck!
> 
> Again, random XOR is *not* the only method used to encrypt data. In fact,
> random XOR could be left out. Consider examining VSACMInternal (in
> INTUNIT.PAS) and VSACMProcessOperation in LIBUNIT.PAS for additional
> information.
> 
> Regards,
> 
> Jeremy Yu-Ramos
> DataET Research
> 



	- Igor.


home help back first fref pref prev next nref lref last post