期刊论文详细信息
Journal of Mathematical Cryptology
Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
Dudeanu Alina1  Jetchev Dimitar1  Bos Joppe W.2 
[1] Laboratory for Cryptologic Algorithms, EPFL, Lausanne, Switzerland;Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA;
关键词: pollard rho;    additive walk;    collision bound;    random walk;    mixing times;    94a60;    05c81;   
DOI  :  10.1515/jmc-2012-0032
来源: DOAJ
【 授权许可】

Unknown   

  文献评价指标  
  下载次数:0次 浏览次数:0次