期刊文献+

一类广义欧拉函数的准确计算公式 被引量:7

The Explicit Formula for a Special Class of Generalized Euler Functions
下载PDF
导出
摘要 为将Lehmer同余式从模奇质数平方推广至模任意数的平方,Cai等(CAI T X, FU X D, ZHOU X. Acta Aritmetica,2002,103(3):203-214.)定义了广义欧拉函数φ e (n).最近Cai等给出了 e=3,4,6 时广义欧拉函数φ e (n)的计算公式.利用初等数论与组合的方法和技巧,完全确定了一类广义欧拉函数的计算公式,即给出当 e 为 n 的特殊正因数时,φ e (n)的准确计算公式,从而推广Cai等的相关主要结果,并由此给出φ e (n)为偶数的一个充分必要条件. For a fixed positive integer n , in order to generalize the modulo from the square of prime numbers to the square of an arbitrary integer for the well known Lehmer congruence formula, Cai, et al(CAI T X, FU X D, ZHOU X. Acta Aritmetica,2002, 130(3):203-214.), defined the generalized Euler function φ e(n) in 2007 and then determined the explicit formulas for φ e(n)(e=3,4,6) in 2013 and 2016. The present paper continues the study, obtains the computing formula of φ e(n) for some special divisor e of n , which is a generalization for the corresponding results of Cai, et al, and then gives a sufficient and necessary condition for 2|φ e(n).
作者 廖群英 LIAO Qunying(College of Mathematical Science,Sichuan Normal University,Chengdu 610066,Sichuan)
出处 《四川师范大学学报(自然科学版)》 CAS 北大核心 2019年第3期354-357,共4页 Journal of Sichuan Normal University(Natural Science)
基金 四川省科技厅科研重点项目(2016JY0134)
关键词 欧拉函数 广义欧拉函数 麦比乌斯函数 Euler function generalized Euler function M bius function
  • 相关文献

参考文献3

二级参考文献28

  • 1Frankel Y,Mackenzie P D,Yung M.Robust Efficient Distributed RSA-Key Generation[C] ∥ Proc of the 30th Annual ACM Symp on Theory of Computing,1998:663-672.
  • 2Lory P.Reducing the Complexity in the Distributed Computation of Private RSA Keys[C] ∥ Proc of Australasian Conf on Information Security and Privacy,2009:250-263.
  • 3Miyazaki S,Sakurai K,Yung M.On Threshold RSA-Signing with No Dealer[C] ∥Proc of the 2nd Int'l Conf on Information Security and Cryptology,1999:197-207.
  • 4Catalano D,Gennaro R,Halevi S.Computing Inverses over a Shared Secret Modulus[C] ∥ Proc of EUROCRYPT'00,2000:190-206.
  • 5Cachin C.Rational Protocols[C] ∥Proc of iNetSec 2009-Workshop on Open Research Problems in Network Security,2009:93-94.
  • 6Halpern J Y.Computer Science and Game Theory:A Brief Survey[EB/OL].[2010-02-05].http:∥www.cs.cornell.edu/home/ halpern/papers/csgt.pdf.
  • 7Halpern J Y,Teague V.Rational Secret Sharing and Multiparty Computation[C] ∥ Proc of the 36th ACM Symp on Theory of Computing,2004:623-632.
  • 8Shoham Y,Tennenholtz M.Non-Cooperative Computation:Boolean Functions with Correctness and Exclusivity[J].Journal of Theoretical Computer Science,2005,343(2):97-113.
  • 9Osborne M J,Rubinstein A.A Course in Game Theory[M].Massachusetts:The MIT Press,2006.
  • 10Gordon S D,Katz J.Rational Secret Sharing,Revisited[C] ∥ Proc of the Fifth Security and Cryptography for Networks,2006:229-241.

共引文献45

同被引文献40

引证文献7

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部