Simple Remarks on Carmichael Numbers

スポンサーリンク

概要

• 論文の詳細を見る

• An odd composite number n for which an-1 ≡ 1 (mod n) for all integers a coprime to n is called a Carmichael number. This paper shows that some class of Carmichael numbers which have relatively large prime factors can be recognized in deterministic polynomial time under the assumption of the Extended Riemann Hypothesis (ERH). Also some related problems are discussed.

• （社）電子情報通信学会の論文
• 2009-01-01

著者

• UCHIYAMA Shigenori

  Tokyo Metropolitan University

関連論文

• The Vanstone-Zuccherato Schemes Revisited(Information Security)
• Simple Remarks on Carmichael Numbers
• On Patarin's Attack against the lIC Scheme
• On the reduction attack against the algebraic surface public-key cryptosystem(ASC04)
• An integer factoring algorithm based on elliptic divisibility sequences

スポンサーリンク