文件名称:program
介绍说明－－下载内容均来自于网络，请自行研究使用
在有限体的范围内，实现了2项式的因数分解的高速化，可以快速求解出特殊2项式的素数。-we describe an improvement of the Berlekamp algorithm for binomials $x^n- a$ over prime fields $\mathbb{F}_{p}$. We implement the proposed method for various cases and compare the results with the original Berlekamp method. The proposed method can be extended easily to the case where the base field is not a prime field
(系统自动生成,下载前可以参看下载内容)
下载文件列表
program\berlekamp\get_base.h
.......\.........\get_factor.h
.......\.........\i_factor.h
.......\.........\jisu1.c
.......\.........\jisu1.exe
.......\.........\jisu1.obj
.......\.........\jisu1.tds
.......\.........\j_cell.h
.......\.........\j_decomp.h
.......\.........\ksk_0009.h
.......\.........\my_get_base.h
.......\.........\my_get_factor.h
.......\.........\pp_calc.h
.......\.........\pp_time.h
.......\.........\p_calc.h
.......\.........\p_decomp01.h
.......\cantor-zassenhaus\can_zass.h
.......\.................\get_base.h
.......\.................\get_factor.h
.......\.................\i_factor.h
.......\.................\jisu1.c
.......\.................\jisu1.exe
.......\.................\jisu1.obj
.......\.................\jisu1.tds
.......\.................\j_cell.h
.......\.................\j_decomp.h
.......\.................\ksk_0009.h
.......\.................\my_p_calc.h
.......\.................\pp_calc.h
.......\.................\pp_time.h
.......\.................\p_calc.h
.......\.................\p_decomp01.h
.......\sai\can_zass.h
.......\...\get_base.h
.......\...\get_factor.h
.......\...\i_factor.h
.......\...\j_cell.h
.......\...\j_decomp.h
.......\...\ksk_0009.h
.......\...\my_get_base.h
.......\...\my_get_factor.h
.......\...\my_p_calc.h
.......\...\pp_calc.h
.......\...\pp_time.h
.......\...\p_calc.h
.......\...\p_decomp01.h
.......\...\sai.c
.......\...\sai.exe
.......\...\sai.obj
.......\...\sai.tds
.......\berlekamp
.......\cantor-zassenhaus
.......\sai
program