Page 5 of 5
Re: BR Algorithms Corner
Posted: 01 Feb 2016 23:52
by SaiK
I am thinking against readability now..
then I was thinking like this question:
http://stackoverflow.com/questions/6334 ... m-hashcode
say generate number, and get a string value. doh! what was I thinking. if that was magic, the zipping technology would be reinvented.
thanks vt
Re: BR Algorithms Corner
Posted: 02 Feb 2016 03:53
by Amber G.
SaiK wrote:I want to generate 8 billion test-data names. readable ....
Is there a better way to do this?
Whatever you do, would be nice to be careful, and not have let a name like "Bobby Drop Table;" get interpreted ...
From: "Exploits of a Mom" series..
(Hope there are DOO's here in brf : ))
Re: BR Algorithms Corner
Posted: 02 Feb 2016 21:18
by Vayutuvan
AmberG ji: that was the trick used to get rid of spammers and their databases. I think there was a case by the spammer in the US. Court ruled it is illegal to reply with drop as it is destruction of private property.
Re: BR Algorithms Corner
Posted: 03 Feb 2016 02:31
by Dipanker
This is a form of SQL injection attack used during late 90's/early 2000's. I won't be surprised if there are still web servers ( armature ones ) still vulnerable to similar attacks!
Re: BR Algorithms Corner
Posted: 03 Feb 2016 04:53
by Vayutuvan
Dipanker: Hat tip, you are right on the money. That is what it was called , i.e. SQL injection attack. The irony was that if one employs it against a spammer it was ruled illegal by the court.
Re: BR Algorithms Corner
Posted: 03 Feb 2016 05:02
by SaiK
it may be illegal by court.. but having such vulnerabilities is costly for chore-porates on account of data loss, service loss, business loss, h&d etc.
amber ji.. no such intention. no interpretations.. only raw data that would be used for some other measures.
Re: BR Algorithms Corner
Posted: 03 Feb 2016 11:25
by ArmenT
Come to think of it, BRF was vulnerable to it too and it was exploited once I believe.
Re: BR Algorithms Corner
Posted: 12 Apr 2016 02:37
by Vayutuvan
David Johnson, Mathemtaical Sciences, Lucent, Murray Hill, NJ has passed away last week. The book "Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)" By Garey and Johnson is the standard reference book and probably has one of the best expositions of the question
P =? NP
A few memorials follow:
Lipton/Regan's Blog
Lance Fortnow's blog
David Johnson 1945-2016 ACM memorial