A pipeline design for the realization of the prime factor algorithm using the extended diagonal structure

DOI10.1109/12.324549MaRDI QIDQ4419794zbMATH OpenOpenAlexFDO

Authors Daniel P. K. Lun, W. C. Siu

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.324549

zbMATH Keywords

Chinese Remainder Theoremextended diagonal structure

Mathematics Subject Classification ID

Factorization (11Y05) Nonnumerical algorithms (68W05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Efficient address generation for prime factor algorithms (digital signal processing)
• A pipeline design of a fast prime factor DFT on a finite field
• An analysis for the realization of an in-place and in-order prime factor algorithm
• scientific article; zbMATH DE number 926141
• A prime factor FTT algorithm using distributed arithmetic

Cited in

(2)

• A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
• A pipeline design of a fast prime factor DFT on a finite field

This page was built for publication: A pipeline design for the realization of the prime factor algorithm using the extended diagonal structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419794)