代码搜索：modulus
找到约 3,028 项符合「modulus」的源代码
代码结果 3,028
www.eeworm.com/read/165417/10063327
key 508.key
Public Key, 508 bits:
modulus: 0c 22 c2 61 ed 7c 06 0d 87 e2 5c 5d a8 7a 92 0e 8b 2a 7e c5 02 bd 51 ef a6 09 b0 a8 d7 ae bb 28 a7 dc c4 12 48 16 2b 60 4c 0c 58 a3 4c 76 4d b4 7a 19 7b d2 f7 3c aa 8e
www.eeworm.com/read/350482/10740855
c bn_mp_mod_2d.c
#include
#ifdef BN_MP_MOD_2D_C
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
* LibTomMath is a library that provides multiple-precision
* integer arithmetic as wel
www.eeworm.com/read/349903/10785738
cpp poly2mod.cpp
/*
* C++ class to implement a polynomial type and to allow
* arithmetic on polynomials whose elements are from
* the finite field GF(2^m).
*
* WARNING: This class has been cobbled together
www.eeworm.com/read/296781/8077695
vhd clk_divider.vhd
---------------------------------------------------------------------------------------------
--
-- File: clk_divider.vhd
--
-- VHDL code to implement a clock divider.
-- The generic value 'modul
www.eeworm.com/read/320439/13427323
key 508.key
Public Key, 508 bits:
modulus: 0c 22 c2 61 ed 7c 06 0d 87 e2 5c 5d a8 7a 92 0e 8b 2a 7e c5 02 bd 51 ef a6 09 b0 a8 d7 ae bb 28 a7 dc c4 12 48 16 2b 60 4c 0c 58 a3 4c 76 4d b4 7a 19 7b d2 f7 3c aa 8
www.eeworm.com/read/318176/13484211
cpp poly2mod.cpp
/*
* C++ class to implement a polynomial type and to allow
* arithmetic on polynomials whose elements are from
* the finite field GF(2^m).
*
* WARNING: This class has been cobbled together
www.eeworm.com/read/494289/6381625
cpp poly2mod.cpp
/*
* C++ class to implement a polynomial type and to allow
* arithmetic on polynomials whose elements are from
* the finite field GF(2^m).
*
* WARNING: This class has been cobbled together
www.eeworm.com/read/156908/11753328
cpp poly2mod.cpp
/*
* C++ class to implement a polynomial type and to allow
* arithmetic on polynomials whose elements are from
* the finite field GF(2^m).
*
* WARNING: This class has been cobbled together
www.eeworm.com/read/116193/14983456
cpp tablefou.cpp
#include "ap.h"
// Basic "four-step" fnt algorithms using table lookups
void tablefourstepfnt (modint data[], modint pr, int isign, size_t nn)
{
size_t n1, n2, j, k, m, o;
modint w,
www.eeworm.com/read/266849/11210586
key 508.key
Public Key, 508 bits:
modulus: 0c 22 c2 61 ed 7c 06 0d 87 e2 5c 5d a8 7a 92 0e 8b 2a 7e c5 02 bd 51 ef a6 09 b0 a8 d7 ae bb 28 a7 dc c4 12 48 16 2b 60 4c 0c 58 a3 4c 76 4d b4 7a 19 7b d2 f7 3c aa 8e