String encryption/Decryption

(no title)

Mon, 10 Sep 2012 01:18:40 +0000

I can't find my Ti-computer cord, could you just post the hex here for me to copy? Or is it already somewhere and I just missed it?

(no title)

Sun, 09 Sep 2012 14:35:54 +0000

Thanks, I'll be sure to look into that!

(no title)

Sun, 09 Sep 2012 14:34:59 +0000

I'll take a look into it, thanks!

String encryption/Decryption

Sat, 08 Sep 2012 22:41:46 +0000

You could also try to write a compression/decompression algorithm to add another level of complexity. For example, you could compress the data, then scramble it accordingly. Then, even if the user could descramble it, it would still be a mess. I came up with a pretty good algorithm (it usually achieved about 40% compression, but never more than 50%), but in BASIC, it would be reallly slow. My first implementation was with Celtic 3 doing most of the work and that took about 10 minutes to compress a 1000 byte string. In assembly it is a fraction of a second, though.

Re: String encryption/Decryption

Sat, 08 Sep 2012 17:22:15 +0000

Just remembered - there was a user that used to be on this forum named calccrypto and (s)he was involved in a lot of encryption discussions. I don't know where they went, but here's their wikidot page:
http://calccrypto.wikidot.com/
Check it out if you're interested!

(no title)

Sat, 08 Sep 2012 14:48:17 +0000

Oh, I see what it does now. Yeah, something like that would probably work; great idea! I'll probably add that in on Monday.

(no title)

Sat, 08 Sep 2012 14:46:59 +0000

Sounds like it would work; only thing I can thing of would be how long it would take to scramble the string.
However, with there being no easy way to input more than half the ASCII characters, I don't really see much of a need for most of them being in the reference string.

(no title)

Sat, 08 Sep 2012 01:56:58 +0000

Xeda's made a really cool program called Xtra2 for that! There are 246 ASCII characters available on-calc. (I don't know why it's 246 and not 256…)
The program has other uses, most importantly Xtra variables, but for your purposes, it can do exactly what is needed:
Store all the special symbols to a string.

So, in thinking of algorithms:
1: Use Xtra to make a string of all ASCII characters
2: Ask for a number password; store to rand
2: Scramble the string using rand
3: Use string-to-list routine
4: Tell user to use same number password to decrypt

And to decrypt:
1: Use Xtra to make a string of all ASCII characters
2: Ask for the password; store to rand
2: Scramble the string using rand
3: Use list-to-string routine
4: Decrypted!

(no title)

Sat, 08 Sep 2012 01:44:27 +0000

It checks the length of the reference string, not the message length.

(no title)

Sat, 08 Sep 2012 01:12:30 +0000

Or just have it store a ? into the encrypted string in its place; it's their fault for not following the guidelines.
(Note: I've updated both programs with progress percentages, as well as an 'allowed characters' guideline on the input screen (It says 'Allowed characters are A-Z, a-z, 0-9, , and .) so it shouldn't be a problem now)

I need to ask burr if he can attribute all these posts to my actual account that's never used.

(no title)

Sat, 08 Sep 2012 01:04:56 +0000

I was think along the lines of getting a string of all not supported characters and just using an instring after they input their string (as well as possibly outputting the invalid character).

I have a few more ideas; however they haven't taken a very definite form yet so I'll research them this weekend or later.

(no title)

Sat, 08 Sep 2012 00:35:07 +0000

Wouldn't that just check the message length and not the character values?

(no title)

Sat, 08 Sep 2012 00:34:05 +0000

"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789" at the moment. I might include a lowercase-enabling asm program, too.

(no title)

Sat, 08 Sep 2012 00:02:01 +0000

by the way, what is the set of characters we're dealing with?
i have mirageOS data on my calc so i can do lowercase letters.

(no title)

Fri, 07 Sep 2012 23:59:30 +0000

oh, i forgot that there was a starting point

(no title)

Fri, 07 Sep 2012 23:51:20 +0000

No - repeats of the same character would be technically pointless and space-wasting, but it wouldn't cause an error with sub().

(no title)

Fri, 07 Sep 2012 23:32:19 +0000

dont forget about repeats of the same character

(no title)

Fri, 07 Sep 2012 23:20:37 +0000

The best way to ensure all characters are valid: (to the best of my knowledge)

:If length(Str7)>max(L₁ // where the reference string is in Str7 and the encrypted info is in L₁ :Then :ClrHome :Disp "Invalid reference code!" :Stop :End

(no title)

Fri, 07 Sep 2012 17:20:51 +0000

Dang that's mean!
sorry

(no title)

Fri, 07 Sep 2012 15:04:47 +0000

So far, I've worked out all the kinks (that I can find); I'm planning on writing a check into the encryptor and decryptor to ensure that all the characters are valid.
Other than that, I've added some nice text telling you what it's doing so that whenever it changes steps, they'll know that it is still doing stuff.

(no title)

Fri, 07 Sep 2012 13:29:55 +0000

Sidenote to a sidenote: Not all "ABCD…6789"'s, you need the last one in DECR and either the last or second to last in ENCR. I think.

(no title)

Fri, 07 Sep 2012 13:10:20 +0000

Sidenote: With this, you would use Str7 instead of the ABCD….6789, and you would either reference this code through another program at the beginning of each program or just copy it in over the key generation.

(no title)

Fri, 07 Sep 2012 13:05:49 +0000

Also, I was using plumcrash until it got blocked.

(no title)

Fri, 07 Sep 2012 13:04:36 +0000

Double correction: for(Z,3,65

(no title)

Fri, 07 Sep 2012 13:02:00 +0000

scratch that last line of code, it should be
for(Z,2,64
str0+sub(str7,Z,1) -> Str0
End

(no title)

Fri, 07 Sep 2012 12:59:52 +0000

Something like this?

Delvar A
Repeat A>0 and A<65
Input "Seed? ", A
End
A -> rand
rand(64 -> L1
seq(X,X,1,64 -> L2
SortA(L1,L2
": -> Str7
For(Z,1,64
Str7 + sub("ABCD….6789",L2(Z),1 -> Str7
End

If you want, add a
sub(str7,2,1 -> str0
seq(str0 + sub(str7,Z,1), Z, 2,64

to truncate the ":" out of str7

(no title)

Fri, 07 Sep 2012 12:55:38 +0000

couple things:
It's filtered as 'uncategorized'
also, if the browser gets a security warning, then the site gets added to our filter's blacklist, unfortunately.

(no title)

Fri, 07 Sep 2012 12:53:10 +0000

For Boba.Foxx:

Whatever page is blocked for you, use https://grapesnake.com (its an http proxy) to get around the block. Your browser will probably tell the site's security has problems, and that it does not recomend using the site, but just ignore the warnings. Also, this method is probably against your school's "accaptable use policy" or something along those lines, so be ware.

(no title)

Fri, 07 Sep 2012 12:07:22 +0000

God, I wish I could log in at school; it would make my life easier and it would let me have karma; I'm going to try copying the wikidot cookies from my other computer. I just have to hope that I can find the place to put it in a mac's filesystem.

(no title)

Fri, 07 Sep 2012 12:05:07 +0000

Sounds good; I'm thinking along the lines of storing the initial number into rand and doing rand(number of characters in ref string) and using the card shuffling method (http:/ /tibasicdev.wikidot. com/randintnorep) to scramble the string.

(no title)

Fri, 07 Sep 2012 02:59:25 +0000

good idea,
may be several algorithms so that 2 reference strings don't get one number, and it will assure that they have to be in the correct algorithm. so pretty much 3 or 4 numbers in a certain order that will all get the same reference code.
i'll try to work on such a translation.

(no title)

Fri, 07 Sep 2012 02:52:57 +0000

I see what you mean, but I don't like the idea of keeping the password inside the list…
Perhaps someone can produce an algorithm that creates a reference string from a single number? And vice versa?
Then the reference string could become a number to memorize and, if the algorithm is good, it'll be very hard to decipher the correlation between the number and a reference string.
I'll start thinking of something during the weekend…

(no title)

Fri, 07 Sep 2012 02:39:04 +0000

a two in one protection system…
a LOOOOONG password
a encryption code…
good idea…
but having the reference code be the password, if someone messes one letter for another, then thats 2 letters in the message they can easily change mentally to fit. i think keeping reference string in a list is better because the program can compare the given reference code to the original and prevents the translation

(no title)

Fri, 07 Sep 2012 02:28:38 +0000

Or just delete the reference string and have the user input it again as a password!

(no title)

Fri, 07 Sep 2012 02:24:22 +0000

you might want to also hide the reference string by applying the reference string to the ABCDEFGHIJKLMNOPQRSTUVWXYZ method and hiding the outcome in another list. the hacker won't know which list is the reference or message and applying either one to the ABCD… method will be result in an confusing outcome because the reference will be a mix of characters.

(no title)

Fri, 07 Sep 2012 00:29:37 +0000

Hmm, could work. The only problem I can think of would be them not putting in the exact same string and getting an error (I generally try to leave my code with as few possibilites for errors as possible) or i could write a routine that sorts their string so that as long as they have all the same characters in their string, it will work.
It's worth a shot,; I'll see what I can do.
I could also ask the user for a number to use in the offset, which makes it a 64-character encryption routine, and the key isn't stored in the string.

(no title)

Thu, 06 Sep 2012 23:01:13 +0000

Here's an idea:
Convert each character into a number with the string-to-list routine as a list. But as a twist, don't use ABCDEFGHIJKLMNOPQRSTUVWXYZ as the reference. Have the user input a string to use as a reference - and they can put them in any order they wish.
To decrypt the list back into a string that makes sense, the user enters in the string they used before and you use the list-to-string routine (with their inputted string, not ABCDEFGHIJKLMNOPQRSTUVWXYZ, of course)!
What do you think?

(no title)

Thu, 06 Sep 2012 16:02:57 +0000

At some point in the near future (probably during calculus), I'm going to rewrite the encryption so it'll be harder to crack (I.E. the encryption key won't be the first character), as well as add support for more characters/tokens.

(no title)

Thu, 06 Sep 2012 15:50:54 +0000

PRGM θDECR (Optimized for speed)

sub(Str0,1,1 -> Str9
instring("ABCD…..6789",Str9 -> R
Delvar L1
Setupeditor L1
For(θ,2,Length(Str1
Delvar W
Instring("ABCD…..6789",Str1->L1
End
L1-R -> L1
For(θ,1,dim(L1
If L1(θ )<1:64+L1(θ) -> L1(θ //Fixes negative values
End
": -> Str1
For(θ,1,dim(L1
Str1 + sub("ABCD…..6789",L1(θ ),1 -> Str1
End

(no title)

Thu, 06 Sep 2012 15:38:26 +0000

Also, the
Y+A -> Y
was the initial encryption offset; that's why I has the Randint(1,64) ->A instead of being an argument in the sub.

(no title)

Thu, 06 Sep 2012 12:03:59 +0000

Jeez, I forgot about the instring command…Now I feel stupid :p

Re: String encryption/Decryption

Wed, 05 Sep 2012 21:53:44 +0000

This code is an optimization of your code in both size and speed :)

PRGM θENCR :Input "", Str1 :sub("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789",RandInt(1,64),1 -> Str0 :For(θ,1,length(Str1 :inString("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789",sub(Str1,θ,1 -> Y :Y+A->Y :Str0+sub("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789",Y,1 -> Str0 :End

All I did was replace your method of converting the character into a number with the inString command.
What was:
Y+A->Y
for?

BTW this is for your first program. I'll look at your 2nd program later.

(no title)

Wed, 05 Sep 2012 16:26:13 +0000

Please forgive any typos in the above post or in this one; I can't edit posts as a guess ;-;
All "ABCD…..6789" is just a shortened "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789".
PRGM θDECR

sub(Str0,1,1 -> Str9
". -> Str1
Delvar θ
While Str1 ≠ Str0
θ+1 -> θ
sub("ABCD…..6789",θ,1 -> Str1
End
Delvar Str1
θ -> R
Delvar L1
Setupeditor L1
For(θ,2,Length(Str1
Delvar W
For(Z,1,64
If sub("ABCD…..6789",Z,1)=Str1:Z ->W
If W≠0:64 -> Z
End
W -> L1(θ-1
End
L1-R -> L1
For(θ,1,dim(L1
If L1(θ )<1:64+L1(θ) -> L1(θ //Fixes negative values
End
": -> Str1
For(θ,1,dim(L1
Str1 + sub("ABCD…..6789",L1(θ ),1 -> Str1
End

String encryption/Decryption

Wed, 05 Sep 2012 16:17:19 +0000

Basically just a string encrypting. I'll post the decrypting program in a bit, when I get some time. The encrypting and decrypting are each kinda slow, so I was just wondering if anyone could help me with it. I'm looking for speed optimization; space optimization isn't that important right now. Here goes:
PRGM θENCR
Input "", Str1
Randint(1,64
sub("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789",ans,1 ->Str0
For(θ,1,length(Str1
sub(Str1, θ,1 ->Str2
Delvar Y
For( Z, 1, 64
If sub("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789",Z,1)=str2:Z -> Y
If Y≠0:64 ->Z
End
Y+A->Y
str0 + sub("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz .0123456789",Y,1 -> Str0
End