Rabin Signature Algorithm - Security

Security

If H is a random oracle, i.e. its output is truly random in then, forging a signature on any message m is as hard as calculating the square root of a random element in . To see that taking a random square root is as hard as factoring, we first note that any square modulo n has four square roots since n has two square roots modulo p and two square roots modulo q, and each pair gives a unique square root modulo n by the chinese remainder theorem. Now, if we have two different square roots, x,y such that but, then this immediately leads to a factorization of n since n divides but it does not divide either factor. Thus taking will lead to a nontrivial factorization of n. Now, there exists an algorithm to take square roots, we pick a random r modulo n and square it, then, using the algorithm to take the square root of R modulo n, we will get a new square root, and with probability half .

Read more about this topic:  Rabin Signature Algorithm

Famous quotes containing the word security:

    “If we could have any security against moods! If the profoundest prophet could be holden to his words, and the hearer who is ready to sell all and join the crusade, could have any certificate that to-morrow his prophet shall not unsay his testimony!”
    —Ralph Waldo Emerson (1803–1882)

    “Modern children were considerably less innocent than parents and the larger society supposed, and postmodern children are less competent than their parents and the society as a whole would like to believe. . . . The perception of childhood competence has shifted much of the responsibility for child protection and security from parents and society to children themselves.”
    —David Elkind (20th century)

    “The three great ends which a statesman ought to propose to himself in the government of a nation, are,—1. Security to possessors; 2. Facility to acquirers; and, 3. Hope to all.”
    —Samuel Taylor Coleridge (1772–1834)