Mark Nelson

Was it maybe Dr Dobb's? Mark Nelson had an excellent series of articles about compression which opened up that world for me. I ended up working on compression for my PhD many years later. I can't find any archives for Dr Dobb's, but some articles are in his personal site, for example this one about arithmetic coding: https://marknelson.us/posts/1991/02/01/arithmetic-coding-statistical-m…

I once found a really great article explaining arithmetic encoding¹, and I felt I understood what was going on and managed to re-implement the article's example from MS-DOS-era C to modern Python, but when I tried to use it for anything else it didn't work and I wasn't smart enough to debug it. The claim that asymmetric numeral systems are simpler than arithmetic encoding is quite interesting, but as a working programmer, I have difficulty with the academic language and mathematical generality used in papers like this. Does anybody have a more approachable explanation of what's going on? ¹: http://marknelson.us/1991/02/01/arithmetic-coding-statistical-modeling…

It is one of your primary duties to safeguard the best interest of your organization. Incontrovertibly, the best interest is not served by storing passwords in plaintext as this can result in grave harm to your organization. Accordingly, while I would not share any details with the outside world, I would advise you to strongly push the issue internally, from the position of an educator. Here are four articles that may assist you in composing a stronger series of arguments: https://www.owasp.org/index.php/Broken_Authentication_and_Session_Mana… http://cwe.mitre.org/data/definitions/256.html http://blog.moertel.com/articles/2006/12/15/never-store-passwords-in-a… http://marknelson.us/2011/02/06/gawker-considered-stupid-criminally-st… You will want to further notate that the effort of implementing non-plaintext authentication really isn't terribly significant. What troubles me is this "most senior" programmer of yours. If storing passwords in plaintext is OK with him/her, meaning that he/she has a weak background in security engineering, I can't imagine that there aren't many additional severe security issues (SQL injection, XSS, CSRF, etc...). Most concerning of all though is that this "most senior" programmer seems disinterested in due diligence and is instead actively arguing against widely known best practices. If, after your strong push, management still is not motivated, personally, I would resign. I would not want to be professionally affiliated…

I should clarify: There's still room for improvement in the speed of lossless compression/decompression operations, and that's where most improvements happen nowadays. But there's little room for improvement in compression ratio, because most modern algorithms produce outputs that are very close to random already. More background: https://marknelson.us/posts/2006/06/20/million-digit-challenge.html

I'm fairly certain compressing random data is nonsensical. In fact there's a cash prize challenge for doing it that has been unmet for 20 years. https://marknelson.us/posts/2012/10/09/the-random-compression-challeng… Not sure I can explain it properly myself but it think it's impossible by definition. Intuitively, if you could compress any random data then you should be able to compress 2 bits into 1, which is clearly impossible.

You should take a look at the almost 15 year old (and unsolved) "Random Compression Challenge" http://marknelson.us/2012/10/09/the-random-compression-challenge-turns…

Another good source for convex hull code (I was using this recently): http://marknelson.us/2007/08/22/convex/

There's a challenge posted online to compress a file of one million presumably random digits, and it's been running for 10+ years without anyone claiming the prize: http://marknelson.us/2012/10/09/the-random-compression-challenge-turns…

For anyone (like me) that isn't familiar with what this would be used for should have a look at the first link the Stack Overflow OP references: http://marknelson.us/1996/08/01/suffix-trees/

personally I prefer this intro: http://marknelson.us/1996/08/01/suffix-trees/ or this one which is slightly harder: http://linux.thai.net/~thep/datrie/datrie.html