In Mild Obfuscation, I proposed
as a “cryptographic” primitive. For 
(more) Mild Obfuscation
December 13, 2011
Leave a Comment » | 
algorithms, hacks, Mathematics | Tagged: congruence, congruent, Encryption, Modular Arithmetic, modulo, roots of unity | 
Permalink
Posted by Steven Pigeon
Mild Obfuscation
November 8, 2011Sometimes, you have a small bit of data, may something like a GUID (for which there are many possible solutions), that you may have to store in a plain-text file, nothing crucial, not sensitive, but that you don’t really want your users to poke with, even if they really mean to. In such cases, you could use encryption, but it may be that mild obfuscation is quite sufficient and dissuasive.
So, if you don’t really want strong encryption, what can you do to provide a machine-efficient encryptionnette?
3 Comments | algorithms, bit twiddling, C, C-plus-plus, hacks, Mathematics, programming, Python | Tagged: bit blenders, bit twiddling, Encryption, MAC address, Modular Arithmetic, xor | Permalink
Posted by Steven Pigeon
Data Insecurity
May 25, 2010It always amazes me to see how people put trust in their service providers. While in principle, there’s no real need to worry, careless implementation of services can really have dire consequences!
And it’s not like leaks and exploits are rare. Sometimes we hear about them, sometimes we don’t. Let’s consider these two (amongst those) I know about:
3 Comments | hacks, Life | Tagged: AppStore, Encryption, Exploit, hash, Myspace, Quick, Service Provider, Services, Trust | Permalink
Posted by Steven Pigeon
