Results 1 to 6 of 6

Thread: Strong Encryption algorithm

  1. #1

    Thread Starter
    Lively Member
    Join Date
    Oct 2000
    Location
    Canada
    Posts
    106

    Strong Encryption algorithm

    I was watching a show on TLC the other day about encryption and cryptography. It discussed the problems of distributing keys for un-encryption. It also showed an encryption algorithm developed that is (if I remember correctly) similar to the RSA method. The formula is:

    m13 (mod k) = e

    m = the message in numbers (i.e. x = 88)
    Note: the m13 is the message (m) to the power of 13 (m * m * m * m * m * m * m * m * etc . . .) but I don't have superscript on my keyboard.

    k = the key (any number . . . i.e. 0.0000178578 to 586839588939 or longer)

    e = the encrypted message

    It is pretty simple . . . the message (m) is multiplied by itself 13 times, then the resulting number is multiplied by the key, which is first inserted in the (mod ). The result is extremely difficult to decrypt without the key.

    Now, my question is, how would I use (mod ) in Visual Basic?

    Thanks,

    JD

  2. #2
    Junior Member
    Join Date
    Jun 2001
    Posts
    22
    well if you're trying to do:
    n (mod k)

    the code would be
    n Mod k

    pretty straightforward...

  3. #3
    transcendental analytic kedaman's Avatar
    Join Date
    Mar 2000
    Location
    0x002F2EA8
    Posts
    7,221
    the problem is that a message^13 is too big for vb to handle if it exceeds 4 bits.
    Use
    writing software in C++ is like driving rivets into steel beam with a toothpick.
    writing haskell makes your life easier:
    reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
    To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

  4. #4
    Junior Member
    Join Date
    Jun 2001
    Posts
    22
    oh yeah, guess i should have read the whole question ...

    there's a trick for this, i'll have to look it up...but i'll get back to you soon

    btw...if you're into cryptography, read Bruce Schnier's (sp?) "Applied Cryptography" ... amazing book...

  5. #5
    Frenzied Member nishantp's Avatar
    Join Date
    Jan 2001
    Location
    Where you least expect me to be
    Posts
    1,375
    your probably better of in C++ cause you can write code to support those huge nums.
    You just proved that sig advertisements work.

  6. #6
    PowerPoster eiSecure's Avatar
    Join Date
    Jul 2000
    Location
    Texas
    Posts
    2,209
    by the way, it's spelled Bruce Schneier.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  



Click Here to Expand Forum to Full Width