20090123, 10:05  #1 
Sep 2002
Vienna, Austria
3·73 Posts 
Multiplication in cyclotomic rings
I am working on an implementation of the APRCL algorithm, and encountered the problem of efficient multiplication in .
The original paper of Cohen and Lenstra only gives the cases . Is there any general method to construct an multiplication algorithm which takes integermultiplies? 
20090123, 22:08  #2  
Nov 2003
2^{2}·5·373 Posts 
Quote:
scheme gets specially constructed. Wieb Bosma's dissertation is a good source of information on this subject. When I did my implementation many years ago, I added k = 9, 17, 18, and 25, but I worked out the schemes using a lot of trialanderror and a lot of help from a CAS. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Basic Number Theory 19: Introducing rings and fields  Nick  Number Theory Discussion Group  0  20170411 18:37 
Cyclotomic primes (degree>=5)  Batalov  And now for something completely different  0  20160621 21:02 
Cyclotomic Polynomial Factoring methods  mickfrancis  Factoring  2  20150111 18:31 
Discrete Ordered Rings?  jinydu  Abstract Algebra & Algebraic Number Theory  2  20131125 09:08 
Cyclotomic Phi  plandon  Math  22  20090729 18:59 