Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Caesar Cipher

by ww (Archbishop)
on Aug 04, 2013 at 20:48 UTC ( #1047827=note: print w/replies, xml ) Need Help??

in reply to Caesar Cipher

Historians sometimes assert that any "encoding system" using a fixed value for the change in positions in the alphabet is a (n example of a) Ceasar Cipher -- ie, if the value for the change is +3, A (in position 1) becomes D (position 4). 13 is the oft-cited value.

In the computer world, it's often called ROT13 for rotate 13 positions. moritz' example above provides an example.

I don't know about a "10 shift to the right" -- certainly, as indicated in para 1, that would be a valid way to implementing a Ceasar Cipher... and so would a 10 shift to the left but (IMO) both would make it easier to err if "encoding" manually.

If I've misconstrued your question or the logic needed to answer it, I offer my apologies to all those electrons which were inconvenienced by the creation of this post.

Replies are listed 'Best First'.
Re^2: Caesar Cipher
by AnomalousMonk (Chancellor) on Aug 05, 2013 at 19:50 UTC
    I don't know about a "10 shift to the right" ...

    Actually, moritz's example is of a 10-position shift, a-j being the first ten letters of the (English) alphabet. Not that it really matters.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1047827]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (4)
As of 2018-05-24 02:34 GMT
Find Nodes?
    Voting Booth?