Hot answers tagged

4

The danger of revealing results in protective coordinates is pointed by David Naccache, Nigel P. Smart, and Jacques Stern's Projective Coordinates Leak, in proceedings of Eurocrypt 2004. As noted in comment, a concise re-exposition is in section 3 of Alejandro C. Aldaya, Cesar P. GarcĂ­a and Billy B. Brumley's From A to Z: Projective coordinates leakage in ...


3

I am asking myself whether there are use cases were a fast signature verification is an important requirement and were RSA would be actually the preferred choice? Well, as you already mentioned the comparison is a bit tricky. For 128 bit security you'd use ECC-256 and RSA-3072 (and using 3072 is on the low end). For most RSA implementations 3072 seems at ...


1

However, to my understanding, the only purpose of Shor's Algorithm is quickly finding the prime factors of very large numbers. Your understanding is incorrect. Shor's Algorithm is usable for both factoring integers and finding discrete logarithms. Shor's algorithm works in two parts. First, it turns the problem (factoring or discrete log) into one of ...


Only top voted, non community-wiki answers of a minimum length are eligible