作者: Rainer Steinwandt , Willi Geiselmann , Regine Endsuleit
DOI: 10.1007/S10207-002-0012-2
关键词:
摘要: We describe several attacks on Polly Cracker, a public key cryptosystem proposed by Fellows and Koblitz. The first kind of attack shows that variations in the CPU time needed for evaluating polynomials can leak significant information about secret key. This might also be interest when dealing with other cryptosystems using polynomial evaluations, like Patarin’s hidden fields equations.