@inproceedings{1235e53e3bb34e529f609bfc387f7d74,

title = "Collision in the DSA Function",

abstract = "We study possible collisions among the values of the DSA function f(s) = (g(s) rem p) rem t where g is order t modulo a prime p and n rem k denotes the remainder of n on division by k. In particular, in a certain range of p and t we guarantee the existence of collisions and also give a nontrivial algorithm for inverting this function.",

keywords = "DSA function, collisions, UNFORGEABLE SIGNATURES",

author = "Shparlinski, {Igor E.} and Ron Steinfeld",

year = "2008",

language = "English",

isbn = "9789812832238",

series = "Series on Coding Theory and Cryptology",

publisher = "World Scientific Publishing",

pages = "226--232",

editor = "Y Li and S Ling and H Niederreiter and H Wang and C Xing and S Zhang",

booktitle = "Coding and cryptology",

address = "Singapore",

note = "1st International Workshop on Coding and Cryptology ; Conference date: 11-06-2007 Through 15-06-2007",

}