i was unable to see any examples for symmetric key algorithms. but why? There are several possible ways to answer this; the most straight-forward is that symmetric key algorithms are based on specific mathematical problems (we just don't usually express it that way). To take some examples of assymetric algorithms: for example ... diffie-hellman, rsa ... ...


A book Introduction to Security Reduction by Fuchun Guo;Willy Susilo;Yi Mu


Insofar as there are security reductions in symmetric cryptography, they tend to apply to constructions using idealised primitives such as a pseudo-random function or a pseudo-random permutation. Thus for example, Luby and Rackoff have proven that it is possible to construct a pseudo-random permutation from a pseudo-random function using a three-round ...

Only top voted, non community-wiki answers of a minimum length are eligible