The Rabin fingerprinting scheme is a method for implementing public key fingerprints using polynomials over a finite field. Given an n-bit message m0,...,mn-1, we view it as a polynomial of degree n-1 over the finite field GF(2). f(x) = m_0 + m_1 x + ldots + m_{n-1} x^{n-1} We then pick a random irreducible polynomial p(x) of degree k over GF(2), and we define the fingerprint of m to be f(x) mod p(x) which can be viewed as a polynomial of degree k-1 or as a k-bit number.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.