Scholarlink

This paper presents algorithms to compute the reciprocal of an integer g modulo an odd integer f. This paper also presents software speeds for $$f=2^{255}-19$$ as a case study. As in some previous work, the software timings are independent of g when $$0

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Accelerating and verifying constant-time modular inversion

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Daniel J. Bernstein,
  • Han-Ting Chen,
  • John R. Harrison,
  • Cesare Huang,
  • Gregory Maxwell,
  • Bow-Yaw Wang,
  • Pieter Wuille,
  • Bo-Yin Yang

摘要

This paper presents algorithms to compute the reciprocal of an integer g modulo an odd integer f. This paper also presents software speeds for $$f=2^{255}-19$$ as a case study. As in some previous work, the software timings are independent of g when $$0