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

Re^3: ROT8000 implementation?

by LanX (Saint)
on Oct 16, 2021 at 08:19 UTC ( [id://11137623]=note: print w/replies, xml ) Need Help??


in reply to Re^2: ROT8000 implementation?
in thread ROT8000 implementation?

As I said, it's a misnomer.

There is no formula with fixed N here because it operates with a 2^16 lookup table to avoid non-printable characters in both directions.

Edit

So the actual N(X) for a mapping

Y=R(X)

N(X)= N(Y)= Y-X

will vary near approximately 2^15-20+-8 (?).*

And it ignores anything >= 2^16 like emojis, similar to ROT13 ignoring any ASCII outside the alphabet.

Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery

*) Actually the description of the author was outdated and doesn't fit his code.

He's excluding 2100 characters.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://11137623]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2024-04-25 04:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found