## (more) Mild Obfuscation

December 13, 2011

In Mild Obfuscation, I proposed

$a^2 \equiv 1 ~(\mathrm{mod}~n)$

as a “cryptographic” primitive. For $n=2^k$, the only possible solutions for $a$ are $\pm{}1$ and $2^{k-1}\pm{1}$. But what are the solutions if $n \not\sim 2^k$? Are there better $n$ than others?

## Mild Obfuscation

November 8, 2011

Sometimes, 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?

## Data Insecurity

May 25, 2010

It 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: