Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: A little fun with merlyn

by Starky (Chaplain)
on Nov 12, 2001 at 11:43 UTC ( #124769=note: print w/replies, xml ) Need Help??

in reply to A little fun with merlyn

Curiously enough, not only does this circumvent merlyn's anti-bot scheme, but (based on the last article I read about PayPal) it could potentially be used to circumvent an important PayPal fraud-prevention scheme that uses a GIF with numbers and letters that a user must type in during a transaction.

The scheme was considered a brilliant accomplishment by industry observers, and widely attributed to the almost instant cessation of certain kinds of fraud on PayPal.

Apparently the bad guys haven't heard of Perl. Of course, a real monk would only use Perl for goodness and the greater benefit of mankind.

P.S. Sorry I don't have a reference to the article mentioned above. It was in some Newsweekesque magazine I was browsing in the gym ....

Replies are listed 'Best First'.
Re: Re: A little fun with merlyn
by Dog and Pony (Priest) on Mar 06, 2002 at 08:51 UTC
    it could potentially be used to circumvent an important PayPal fraud-prevention scheme that uses a GIF with numbers and letters

    I must say that I find that highly unlikely. Take a look at Paypal registration to see an example of the images generated - even though I am a firm beleiver that anything can be written in perl, eventaully, this really funny little trick isn't coming close to breaking the paypal images. Nor was it intended to, of course. :)

    Reading a character in an image is old news as such, so paypal uses a lot of different "blurring" techniques, such as drawing lines at random intervals, moving the characters inside the image and using a font that is hard to interpret - and probably other things too.

    Just so any paypal users can sleep a little tonight...

    You have moved into a dark place.
    It is pitch black. You are likely to be eaten by a grue.
      Interesting. I wonder if it might be possible to use something like a hopfield network to defeat such schemes. Ages ago, I wrote a simple implementation, and it's available here, but that code is probably both ugly and not as algorithmically good as it could be.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://124769]
[LanX]: or two 20 min
[Corion]: IME it doesn't matter whether it's a 20 min talk or 40 min talk ;)
[choroba]: I only applied for 20 minutes this time
[choroba]: I hope it still means I don't have to pay the conference fee
[LanX]: true it's the built up which is stressy

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (7)
As of 2018-04-23 09:32 GMT
Find Nodes?
    Voting Booth?