Printable View
Can anyone identify this encryption method and can anyone tell me if this is secure?
"antionline" is encrypted as: "21566248525351475139"
Can you please tell me if this is a known algorithm since I have never seen this before.
Another text that has been encrypted that way, which I’m trying to figure out, is: "423755394574895052713266896225412357"
Thanks in advance and any help or advice will be greatly appreciated.
Qwert1515
What is the name of the encryption method? That's step number 1.
:( Thats one of the main problems, I don't know, I was hoping somone else might, thanks for the responce.
Qwert1515
Is this some kind of game you are playing? Are you using something to hash "antionline"?
How did you know that antionline hashed as "21566248525351475139" with this algorithim unless someone else did it?
My friend told me that he has found a alogorithum that is quite secure (since it uses a 512 bit encryption format) on a Graphing Caculator (TI-83+), he also told me that it is quite fast to encrypt text, He asked me to look at ""423755394574895052713266896225412357"" and try to decrypt it . I asked for a little hint and told him to encrypt "antionline" and he encrypted it using the format. ""21566248525351475139"" I was wondering if anyone has seen this format and if it is safe & secure to use. If it will help I might be able to get the source code from the program if anyone can tell me what it is.
Also is it possible to create a "fast" 512 bit encryption on a Caculator, I don't think so , but I might be wrong.
Agh sorry I negged you. Can a Mod flip that? I just wanted to tell you to post that source without posting again.
Damn Ive been doing that a lot lately.
Done!Quote:
Agh sorry I negged you. Can a Mod flip that? I just wanted to tell you to post that source without posting again.
Damn Ive been doing that a lot lately.
is it possiable to put linux on a graphing calc?...i would do it in a heart beat or less
[offtopic]
hexadecimal: My question for you is... WHY!?
You've gotta be one hell of a hard core geek to try something like that...
If you were to put it on something... it'd have to be widely used to get more people to develop for it...
Say a ti83? Even then... it'd be one hell of a challenge...
Processor: Z80
Speed: 6 MHz
Display: 94 x 64 pixels
Memory: 27k RAM
Ouch!
For another $100 you can get yourself a device that will run it that is being developed already... say a Sharp Zaurus? Last I saw you could get them on ebay for like $200 or so?
Heck... I got my Toshiba e755 for like $150 ($450 new) and there are people developing for that. At lest it'll support wireless interfaces...
I've even seen people developing for a palm pilot... I have a TT3 and like it with the palm OS.
Maybe one day I'll try to put linux on one of those things... when I'm not using them like I do now.
[/offtopic]
Sorry for adding to the hijacking of this thread...
Sorry but since there are some characters on the caculator which I couldn't put in text I had to upload a jpeg. If you would like any more information please reply.
Sorry to be too picky but this ain't hashing, it's encrypting. WAY different ball-games :)Quote:
Originally posted here by Soda_Popinsky
Is this some kind of game you are playing? Are you using something to hash "antionline"?
How did you know that antionline hashed as "21566248525351475139" with this algorithim unless someone else did it?
Anyway I'll look at it and try to find something out... too bad I have no idea how the TI programming works... but heck with it, I'll just use my general programming skills to make something out of the algorithm.
qwert1515, I hope your friend isn't pulling a joke on you. It's quite possible that the other ciphertext is jibberish so you'd better be sure you can trust the other person.
I'm thinking to reverse engineer his algor, we will need alot more hashes/equivalents to make a key/table.......sorry, I'm not much of a geek on crypto
Since I know the method used is there a "easy" way to find the key used to encrypt the second message, since it is basicly 512 number random number?
Does this method look secure?
Thanks
Qwert1515
hypronix: I don't see any mention of a key, so I figured that this is a hashing method.
I used to do pretty well with TI-83+ language in high school from study halls, but it looks foreign now.
Yeah it could've been. But the second ciphertext is of a different length, and hashes are supposed to be of constant output.Quote:
Originally posted here by Soda_Popinsky
hypronix: I don't see any mention of a key, so I figured that this is a hashing method.
The issue of a key is important though, if there is none we're dealing here with a static algorithm [which in my books isn't something very secure]. If there is a key I think we need more information [captured ciphertext and whatnot] before a surefire way of breaking the algorithm can be devised.
In the Antionline example that you give in your first post. It looks to me that each letter of Antionline is represented by two numbers. So i would think that the code could well be based on the One Time Pad method, if this is the case then the code will be very difficult to crack. As not only would you need the Key but also the text that was used to Encrypt the message.Quote:
basicly 512 number random number