Messages in this thread | | | Subject | Re: A new, fast and "unbreakable" encryption algorithm | From | Łukasz Stelmach <> | Date | Thu, 19 Nov 2015 13:12:27 +0100 |
| |
It was <2015-11-18 śro 06:25>, when Ismail Kizir wrote: > Hello, > > I've developed a new encryption algorithm, which dynamically changes > the key according to plaintext and practically impossible to break. [...] > I will be glad to see my algorithm included in Linux distributions. > Please feel free to ask if you have any questions.
How resistant to side-channel attacts is or can be an implementation of your algorithm? Not being an expert I am a bit worried about this particular line
XORVal ^= *(Salt + (LastVal&(SALT_SIZE-1)));
which if I understand it correctly makes a memory access depending on secret data. Because memory accesses are note constant time operations due to cache one might try (and succeed?) learning about secrets by measuring time required to encrypt or decrypt data.
-- Łukasz Stelmach Samsung R&D Institute Poland Samsung Electronics [unhandled content-type:application/pgp-signature] | |