Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Hex String XOR

by Marshall (Prior)
on Mar 12, 2012 at 08:48 UTC ( #959081=note: print w/ replies, xml ) Need Help??


in reply to Hex String XOR

I know question #2, chr() and ord()

#!/usr/bin/perl -w use strict; printf "%X\n", ord('a'); #61 printf "%X\n", ord('b'); #62 print chr(0x61); #a
still working on the best formulation for question #1. An issue is how to make it efficient.

Update: I think Moritz is on it.

pack() and unpack() are cool critters, but sometimes you have to stare at it for awhile. Example from the doc's:
sub ordinal { unpack("W",$_[0]); } # same as ord()

ord() and chr() are pretty "lightweight" critters. Without testing, I don't know if some kind of substr() based approach would be slower or faster. I assume for crypto, speed would be a major factor. On this performance point, I just don't know at the moment.


Comment on Re: Hex String XOR
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (11)
As of 2015-07-29 11:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (263 votes), past polls