Conflict characteristics of universal classes of hash-functions
Annotations languages:
Description: Estimations of privacy for universal classes of hash -functions are considered. Expressions for probability of imitation and substitution of messages are received.
Reference:
Artemenko, E.A. (2006), “Kollizionnye kharakteristiki universalnykh klassov khesh-funktsii”, Information Processing Systems, Vol. 1(50), pp. 3-6.
Artemenko, E.A. (2006), “Kollizionnye kharakteristiki universalnykh klassov khesh-funktsii”, Information Processing Systems, Vol. 1(50), pp. 3-6.