[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]


    Search the Q&A Archives


Just curious if anyone has heard of a progressive shift...

<< Back to: Cryptography FAQ (01/10: Overview)

Question by CrypKid
Submitted on 6/25/2004
Related FAQ: Cryptography FAQ (01/10: Overview)
Rating: Not yet rated Rate this question: Vote
Just curious if anyone has heard of a progressive shift method.  I was fiddling around and trying to develop some sort of simple algorithm.  Simply put, using the entire ASCII alphabet (and programming in C++) I've developed a program that shifts the first letter one position, the second letter two positions, third letter three, etc.  It encrypts letters as well as spaces and punctuation, making the text look completely random.  I know it's really simple, but it's a start :-P, just wanted to share and find out if anyone thought it was interesting


Your answer will be published for anyone to see and rate.  Your answer will not be displayed immediately.  If you'd like to get expert points and benefit from positive ratings, please create a new account or login into an existing account below.


Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer:

FAQS.ORG reserves the right to edit your answer as to improve its clarity.  By submitting your answer you authorize FAQS.ORG to publish your answer on the WWW without any restrictions. You agree to hold harmless and indemnify FAQS.ORG against any claims, costs, or damages resulting from publishing your answer.

 

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

 

<< Back to: Cryptography FAQ (01/10: Overview)


[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]

© 2008 FAQS.ORG. All rights reserved.