|
qrpff is a Perl script created by Keith Winstein and Marc Horowitz of the MIT SIPB. It performs DeCSS in six or seven lines. The name itself is an encoding of "decss" in rot-13. The algorithm was rewritten 77 times to condense it down to six lines. In fact, two versions of qrpff exist: a short version (6 lines) and a fast version (7 lines). Both appear below. Short: #!/usr/bin/perl # 472-byte qrpff, Keith Winstein and Marc Horowitz # MPEG 2 PS VOB file -> descrambled output on stdout. # usage: perl -I # where k1..k5 are the title key bytes in least to most-significant order s''$/=\2048;while(<>)(16..271))()^((D>>=8 )+=P+(~F&E))for@a()}print+qT,@a}';s/()/\$$&/g;s/q/pack+/g;eval Fast: #!/usr/bin/perl -w # 531-byte qrpff-fast, Keith Winstein and Marc Horowitz # MPEG 2 PS VOB file on stdin -> descrambled output on stdout # arguments: title key bytes in least to most-significant order $_='while(read+STDIN,$_,2048)@ARGV;s/...$/1$&/;$ d=unxV,xb25,$_;$e=256|(ord$b())<<9|ord$b();$d=$d>>8^($f=$t&($d>>12^$d>>4^ $d^$d/8))<<17,$e=$e>>8^($t&($g=($q=$e>>14&7^$e)^$q *8^$q<<6))<<9,$_=$t()^ (($h>>=8)+=$f+(~$g&$t))for@a()}print+x"C *",@a}';s/x/pack+/g;eval The fast version is actually fast enough to decode a movie in real-time. qrpff and related memorabilia was sold for $2,500 at The Algorithm Auction, the world’s first auction of computer algorithms. == References == 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「qrpff」の詳細全文を読む スポンサード リンク
|