Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Yet Another Obfuscation Engine

by ambrus (Abbot)
on Mar 29, 2004 at 08:49 UTC ( #340543=note: print w/replies, xml ) Need Help??


in reply to Yet Another Obfuscation Engine

Without knowing about this node, I wrote Re: Re: exactly 390 bytes.

It is not a complete obfu-engine, just lists compact encoding of the first few numbers. For some punctation chars, it gives a bit shorter encoding than yours (while it has longer ones for most others). For example:

_ = chr log sqrt exp hex be = chr oct hex ord uc yz

From these encodings, I especially like those relying on that oct stops scanning a number when it meets a digit 9.

What I find really strange is that expressions with length aaaaaaaaaaaaaa or those with length qr taaaaaat never give an optimal encoding.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://340543]
help
Chatterbox?
[Corion]: LanX: Ah, yeah - Frankfurt is in the quake region, but at the very border. I think I've never noticed a quake in Frankfurt myself
[marto]: good morning all
[Corion]: On another topic, in the process of Rubber Duck SoPWing, I wrote a post about the best API for generating HTTP requests (not sending them) and while writing it and fleshing out my sample implementation, I came up with some improvements to my ...
[Corion]: ... existing prototype. Cartesian Products will be proud of that module once it gets out ;)
[Corion]: Hi marto ;)

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (9)
As of 2017-01-18 10:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (161 votes). Check out past polls.