Pages: [1]
  Print  
TS Forum > Internet Privacy > Encryption > Peer review my encryption methodology?  
Author Topic: Peer review my encryption methodology?  (Read 677 times)
rascalcode
Newbie
*
Posts: 2


View Profile Email
« on: April 02, 2010, 06:54:30 am »

Hi - I am Ron, and my interest is writing alternate encryption methods.  I thought this might be a good place to get come comments on my methodology - sort of a peer review.

I think DES and AES are unintuitive and just messy and my attempt is to use simple procedures that can be combined to produce Cryptographically Secure (CS) encryption procedures.

I have written a subroutine library that I think is very powerful and can allow almost anyone to write their own powerful encryption code.  I am not asking for a critique of the code, but an analysis of the ideas.  I subset I can write unbreakable code (55,000 bit encryption) with keys each as long as 4,000 UTF-8 bytes (keyboard of text file content was the idea.)

Is this the right place?  Here is a teaser...

http://rascalcode.home.bresnan.net/case.html

Ron.
Logged
johncrackernet
Johncrackernet
Global Moderator
Newbie
*****
Posts: 41


cracker_uitm
View Profile WWW
« Reply #1 on: April 02, 2010, 05:32:40 pm »

Good man...nice article

Logged
rascalcode
Newbie
*
Posts: 2


View Profile Email
« Reply #2 on: April 03, 2010, 09:41:26 pm »

Thanks...   Here is the 2nd teaser (with links to the main body of the argument in the tutor file.)

http://rascalcode.home.bresnan.net/basics.html

And here is a sample encryption/decryption using the ideas  in JavaScript so you can see how it works.

http://rascalcode.home.bresnan.net/rascal.html

I appreciate your reply...

Ron...
« Last Edit: April 03, 2010, 09:48:55 pm by rascalcode » Logged
Ðimi
Global Moderator
Hero Member
*****
Posts: 750


Some Call It A Slingblade, I Call It A Kaiser


View Profile
« Reply #3 on: May 31, 2010, 11:25:25 pm »

"The actual depth of encryption is directly related to the length of the key you use"

On that note, how are you controlling the length of the hash then? For example SHA-256 produces a 256-bit hashed string.

Nice page, btw

Logged
   
Pages: [1]
  Print  
 
Jump to:  

Forum powered by SMF | © 2010 TriviaSecurity. All rights reserved.