Bucket Sieving

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous number of memory updates; however, these updates usually cause cache hit misses. The proposed algorithm significantly reduces the number of cache hit misses when the size of the sieving region is roughly less than the square of the cache size, and the memory updates are several times faster than the straightforward implementation according to the PC experiments.

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

著者

• AOKI Kazumaro

  NTT Information Sharing Platform Laboratories, NTT Corporation

• Ueda Hiroki

  Ntt Information Sharing Platform Laboratories Ntt Corporation

• Aoki Kazumaro

  Ntt Information Sharing Platform Laboratories Ntt Corporation

• Aoki Kazumaro

  Ntt Informating Sharing Platform Laboratories Ntt Corporation

関連論文

• Efficient Algorithms for Tate Pairing(Elliptic Curve Cryptography, Cryptography and Information Security)
• Practical Password Recovery Attacks on MD4 Based Prefix and Hybrid Authentication Protocols
• Improvements of Addition Algorithm on Genus 3 Hyperellipic Curves and Their Implementation(Public Key Cryptography)(Cryptography and Information Security)
• Bucket Sieving
• A Cyclic Window Algorithm for Elliptic Curves over OEF(Special Section on Cryptography and Information Security)
• Preimage Attacks against PKC98-Hash and HAS-V

スポンサーリンク