代码搜索:Modular

找到约 9,839 项符合「Modular」的源代码

代码结果 9,839
www.eeworm.com/read/197077/8032114

txt 素数随机判定(miller_rabin).txt

//miller rabin //判断自然数n是否为素数 //time越高失败概率越低,一般取10到50 #include #ifdef WIN32 typedef __int64 i64; #else typedef long long i64; #endif int modular_exponent(int a,int b,int n){ //a^b
www.eeworm.com/read/149876/5695017

s ls-modaddr.s

; Modular address postincrement/postdecrement test start: ; program PSW for modular address mode add r1,r0,0x81000000 nop || nop mvtsys psw,r1 || nop nop || nop test1: ; set modular add
www.eeworm.com/read/148694/5710456

s ls-modaddr.s

; Modular address postincrement/postdecrement test start: ; program PSW for modular address mode add r1,r0,0x81000000 nop || nop mvtsys psw,r1 || nop nop || nop test1: ; set modular add
www.eeworm.com/read/125279/6031971

in config.alg_1des.in

if [ "$CONFIG_IPSEC_ALG" = "y" ]; then tristate ' 1DES **INSECURE** encryption algorithm (modular alg)' CONFIG_IPSEC_ALG_1DES fi
www.eeworm.com/read/117181/6109298

s ls-modaddr.s

; Modular address postincrement/postdecrement test start: ; program PSW for modular address mode add r1,r0,0x81000000 nop || nop mvtsys psw,r1 || nop nop || nop test1: ; set modular add
www.eeworm.com/read/492302/6421231

c gcm_reset.c

/* LibTomCrypt, modular cryptographic library -- Tom St Denis * * LibTomCrypt is a library that provides various cryptographic * algorithms in a highly modular and flexible manner. * * The librar
www.eeworm.com/read/484221/6581872

htm q10229.htm

Q10229: Modular Fibonacci 禣
www.eeworm.com/read/478955/6708622

txt 素数随机判定(miller_rabin).txt

//miller rabin //判断自然数n是否为素数 //time越高失败概率越低,一般取10到50 #include #ifdef WIN32 typedef __int64 i64; #else typedef long long i64; #endif int modular_exponent(int a,int b,int n){ //a^b
www.eeworm.com/read/403717/11512735

txt 素数随机判定(miller_rabin).txt

//miller rabin //判断自然数n是否为素数 //time越高失败概率越低,一般取10到50 #include #ifdef WIN32 typedef __int64 i64; #else typedef long long i64; #endif int modular_exponent(int a,int b,int n){ //a^b
www.eeworm.com/read/400753/11569525

txt 素数随机判定(miller_rabin).txt

//miller rabin //判断自然数n是否为素数 //time越高失败概率越低,一般取10到50 #include #ifdef WIN32 typedef __int64 i64; #else typedef long long i64; #endif int modular_exponent(int a,int b,int n){ //a^b