Спосіб ключового хешування теоретично доведеної стійкості

Abstract

The keyed randomizing method for theoretically proved capability consists in giving information data M as M={m1, m2,..., mt}sequence, key data K is given as a big secret number k and information data randomizing is performed by means of big prime number p modulo raising with modulo raising device, the big secret number is used as an initial filling h0, a task of randomizing key crack resolves itself to calculation of a discrete logarithm in the simple field. The big number g is raised, which is a primary p modulo root, the power to be raised is a result of addition of information sequence item value mi and a result of previous information sequence item value randomizing.