Jump to content
  • Sky
  • Blueberry
  • Slate
  • Blackcurrant
  • Watermelon
  • Strawberry
  • Orange
  • Banana
  • Apple
  • Emerald
  • Chocolate
  • Charcoal

AlexINF

Members
  • Content Count

    2
  • Joined

  • Last visited

Posts posted by AlexINF

  1. Okay, so I'd like to discuss with you a "new" topic that I came up with not so long ago.

    I have no idea if it is patented or invented already, if so, tell me. [EDIT: It was invented already, and it is called "Vigenère cipher"]

    It consists of a new hashing method. And, as far as I have investigated, it's pretty secure.

    It works like so: There are 3 variables, the text to hash, the key, and the dictionary. The text to hash is just text formed from letters of the dictionary, the key is used to encrypt the text, and the dictionary lists the characters that form the text.

    So, you might have heard about the caesar ciphering technique. If not, you'll want to read this article in wikipedia.

    Well, this method works the same as the original technique, but the key tells each character how much shift you have to apply.

    Let me explain. Imagine the text is "hello", the key "1 2 3 4 5 right" and the dictionary all the letters of the english alphabet (abcdefgh...)

    Then, you grab the first letter of the text (h) and right shift them 1 character, as said in the key. That would result in an "i". Then you do the same with all the letters, and you get... "igqrt". There you go, your hashed text.

    That's not all. If you want, you can resemble another words making the key shifting each letter to the one in the word you want to create.

    Is it secure?
    Yeah. And pretty fast, too. There's no way of getting any of the other variables unless you already have 2 of them (Example, you can't get the key just with the password, you also need the text.)
    If you want a lot of security, just make a large password, and a huge dictionary.

     

    That's all. Thanks for reading.

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use and Privacy Policy.