# Homomorphic Encryption or not

I am a beginner to homomorphic encryption scheme. As far as I think, it is just a kind of concealing real value without using standard encryption algorithms such as AES,DES or RSA. For example , for concealing value of $3$, it expresses $6$ where ($6=2 \times 3$). Decryption is done successfully if user knows $2$ (secret value). Is it correct or not?

• Couldn't you cast RSA, for example, in this same light? You are concealing the message $m$ as $m^e\bmod{n}$. You can only decrypt if you know the secret $d$, which cancels out the $e$. – mikeazo Apr 15 '16 at 14:51
• In other words, I'm having a hard time understanding what your question really is. – mikeazo Apr 15 '16 at 14:53
• My real intention is just to conceal message without using standard algorithm. Just wanna use light function. – astyst Apr 15 '16 at 14:59
• So your real intention has nothing to do with homomorphic encryption? What is your definition of a "light function"? There are light-weight ciphers, do you mean something that can be done by pen and paper in reasonable time? – Thomas M. DuBuisson Apr 15 '16 at 18:10
• Your last comment means that you simply want a very simple encryption scheme. But it unfortunately follows that the security of your scheme would be very low or negligible. Cf. the ubiquitous Principle of No Free Lunch. Extending the example that you have provided yourself, a permutation polynomial mod 2**n could be of use to you, since it bijectively maps blocks of n bits. However, the secret key hereby involved, namely the coefficients of the permutation polynomial, could be recovered by the adversary, if he manages to know a correspondingly small number of pairs of plaintext and ciphertext. – Mok-Kong Shen Apr 17 '16 at 9:48