1
$\begingroup$

(All programmed in Visual Basic) How it works is it gets a random number from 1 to 30000 and changes the first character by it in Unicode then it uses that number to change the first character of the key then it gets a new random number and repeat so that the key is entangled in to the end result. Which is how it is decrypted by guessing the number for each of the key values till it is the same as what we know the key should look like the then the corresponding letter from the message is decrypted with the same number. Boy is it hard to explain and I am bad at writing I will link to the git hub when I do it https://github.com/VeryG00dName/Encrypter

$\endgroup$

closed as unclear what you're asking by yyyyyyy, AleksanderRas, fkraiem, Ella Rose Jun 30 at 22:35

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

3
$\begingroup$

The folks here aren't keen on performing analyses of encryption algorithms, and a load of code in git doesn't help much with that either unfortunately.

What I would say though is that you seem to have yourself a stream cipher. Have a look at chapters 5 & 6 of Handbook of Applied Cryptography.

One of the issues will be your random numbers. Consider that any computer can easily just try all 30,000 of them sequentially until the message makes sense. We can just do this and it's called a brute force attack.

$\endgroup$
  • $\begingroup$ Thank you. I thought since each character is encoded by a new random number that it would take a long time plus you could just run it through the program more than once. $\endgroup$ – Alex Jun 30 at 22:17
  • 1
    $\begingroup$ @Alex Yes, but consider where the random numbers come from. Chances are they stream one after another depending very obviously on the previous one. See what a cryptographically secure random number generator is, and how to start one off (seeding). If you're using one already you probably need a totally different question :-) $\endgroup$ – Paul Uszak Jun 30 at 22:32
  • $\begingroup$ @Paul Uszak There is a very good reason that some of the folks here are not good at performing an analysis of cryptographic algorithms. Schneier's book, though good, has gotten old. No one has created an updated encyclopedic reference that clarifies the whole picture. $\endgroup$ – Patriot Jun 30 at 22:51
  • $\begingroup$ @Patriot I'm sure that you're right. It's just that I consider this type as some of the most important questions on the whole site. A new user has show an active and practical interest in crypto. It's right to help and encourage, even though I agree that we can't parse much code. I think of the handbook as part of a crypto customer acquisition toolkit. Is there really nothing more recent? An opportunity then for Schneier Edition 2? $\endgroup$ – Paul Uszak Jun 30 at 23:54
  • 1
    $\begingroup$ @Paul Uszak One of you needs to get busy. Fame awaits! Joking aside, someone needs to write a clear and comprehensive book on cryptography that can update and replace Mr. Schneier's venerable tome. $\endgroup$ – Patriot Jul 1 at 0:58

Not the answer you're looking for? Browse other questions tagged or ask your own question.