Encrypting?

[Darth Android]

[Toksyuryel]

It's really quite simple. The largest number you can get is 9e99, meaning 100 digits. Then double that with decimals, and you've got yourself 200 spots for individual numbers, or 50 pixel coords per number. Only 9 bytes per number!

[Darth Android]

i need it to compile to a string though. will it still work?

[edit] ill see if i can get it to work with lists.... hav a LITTLE free time right now...

[Toksyuryel]

It will work for strings, but you won't get any saved space.

Adm.wiggin: do you know how get individual decimal digits too?

[Darth Android]

err.. tried it, can only get 1E99 b4 an overflow error and the calc doesnt calculate more than 15 places in front of AND behind the decimal.

[Adm.Wiggin]

no, sorry... but im sure it would be something like the same idea, just do something like this (A = 123.456, you want B to become 5) :

[Toksyuryel]

OK I've figured it out. I'll post the code for it later, but here's how it works:

A couple weeks ago, I made a game for my winTI OS called Hi-Lo. It's completely graphical, including a section where you need to enter a number to set as your "bet". The way that works is that you enter individual digits and then it puts them together into a number. If I can figure out how to reverse engineer that system(instead of puting the number together, it takes it apart), I'll have the PIC.zip(tm) system all ready.

[62 52 53 53]

can you post the code so we can look at it, and maybe figure it out for you?

[Toksyuryel]

Well I've hit a little snag... unfortuneately, you can only store 14 digits on either side of the decimal point SO, I'M SKREWED!

[Jeffrey]

Say you have a string of pixels 1=on 0=off, I will do 20 consecutive pixels for this example:

" 0 0 0 0 0 0 1 0 0 1 0 1 1 1 0 1 0 0 1 0"

You could use the pattern idea!!!

1= 0 0
2= 0 1
3= 1 0
4= 1 1
5= EOF

That encompasses all possibilities for a two bit series of pixels. So now you could say:

" 1 1 1 3 2 2 4 2 1 3 5" to store that list above. Now you can only use this on a list that has a number like 96 or 12, where you could divide the number by 2 and get an even number. Use the 5 to make the list parser jump to the next line.

And you would have to make a parser. Thats another thing, you would add more file size to the program to make the maps smaller, lol.

[Toksyuryel]

Hey that's not a bad idea. I think I'll try that. Thanks jeff. Welcome to the credits

[Jeffrey]

Thanks! You could also further compress it but it would acutally get quite large. I will try to write a qbasic program to illustrate the 2 bit series compression.

[Adm.Wiggin]

a more logical pattern for the compression would be :
0-00
1-01
2-10
3-11

that is TRUE binary

[Jeffrey]

True, but you get my idea. Its all the same, pretty much. You could easily make a program that would compress a list to the pattern method.

[Pyxle]

hey..i have made a program that takes the "binary" of a character
(ie A="01000000") puts it into a string.
I am using the entire spectrum of the byte so i could transfer programs
by encrypted pictures if i need to.
(ie ti-basic commands to string format then string to picture)
The program then puts the string into a pic. It reads the string and turns
on a pixel if the sub( equals 1, then moves to the right and reads the
next sub(. it goes until pixel location 88 because of the 8 binary numbers
i guess that i could go until pixel location 94 but that would be a pain to implement a "word wrap"-like function.

i can fit 693 characters on one pic...but i do need to store the last character byte to a list or else the reading program is screwed. The string is actually smaller than the pic..but the pic is more secure than strings (ie use, overwriting, high-scores).

could someone help me find a way to use the "word wrap" function so i can make
string to pic compression/encryption more feesable?
BTW the proccess is rather slow because of individual pixels are being uniquely placed but the code is really rough and not optimized for efficiency
(was bored in Algebra class 8P)

ooo! oo! you could Xor it!

If you want i can post the code later (if i find time)

my 2c

[Basjuh]

And what about hash encryption or one way encryption... anybody an idea to do that?

[DarkerLine]

I have written a program that will compress some pictures to strings rather effectively. The smallest the resulting string could be is 16 bytes. Unfortunately, the largest it could be is 11981 bytes . The program uses Symbolic's function to convert numbers to strings (The string resulting looks like "+12-3+94-1+1-1..." with a symbol showing whether on or off and the number showing how many pixels are on or off. So one extreme case is "+5985" and the other "+1-1+1-1+1..."). I could also write a decompressing program but I doubt anyone will be interested in this...

[DigiTan]

I'd certainly be interested. A good, compact hash generator could be especially useful for hiding passwords from all the HEX viewer progs out there.

[Basjuh]

im working on one, it wont be very large, but it isnt completely working yet...
i found a very small one in VB and im busy converting it...

[Basjuh]

[/B]i finished the hashing program and it works perfectly its size is 1222 byte, thats not very large for all the secuity you'll get from it...

example:

input = HASH
output = *DFGWAOMUJAFNAL


Update:

i made the program a lot faster and smaller. its size is now exactly 200 byte, also added some characters you can now use:
ABCDEFGHIJKLMNOPQRSTUVWXYZ@ :?1234567890

note: @ = theta

example:

input = HASH
output = *5OT8OAK2GKDCT3K1