國立清華大學 數學系

Abstract：
RSA is widely used in modern cryptographic applications, with certain RSA-based protocols relying on the secrecy of the prime factors $p$ and $q$. A common approach to preserving their privacy is through secure multiparty computation. In the specific context of distributed RSA modulus generation, the biprimality test for Blum integers $N=pq$, where $p\equiv q\equiv 3 \mod4$, proposed by Boneh and Franklin (2001), is the most commonly adopted method. This talk will examine that test and further explore an alternative biprimality test derived from the Lucas sequence.