Bucket Sieving
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.8 pp.1845-1850
- Publication Date
- 2009/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E92.A.1845
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
- Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazumaro AOKI, Hiroki UEDA, "Bucket Sieving" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 8, pp. 1845-1850, August 2009, doi: 10.1587/transfun.E92.A.1845.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1845/_p
Copy
@ARTICLE{e92-a_8_1845,
author={Kazumaro AOKI, Hiroki UEDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Bucket Sieving},
year={2009},
volume={E92-A},
number={8},
pages={1845-1850},
abstract={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.},
keywords={},
doi={10.1587/transfun.E92.A.1845},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Bucket Sieving
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1845
EP - 1850
AU - Kazumaro AOKI
AU - Hiroki UEDA
PY - 2009
DO - 10.1587/transfun.E92.A.1845
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2009
AB - 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.
ER -
English
