Jebelean--Weber's algorithm without spurious factors
Inf. Process. Lett.(2007)
摘要
Tudor Jebelean and Ken Weber introduced in [10, 4] an algorithm for finding a (a, b)-pairs satisfying au + bv equiv 0 (mod k), with 0 < |a|, |b|< radic(k). It is based on Soren- son's "k-ary reduction" algorithm ([9]). One of the major drawbacks is that this algorithm do not preserves the GCD's. We present a modified version which avoids this problem.
更多查看译文
关键词
tudor jebelean,ken weber,mod k,spurious factor,gold,process algebra,time complexity,programming,cryptography,computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要