代码搜索:modulus

找到约 3,028 项符合「modulus」的源代码

代码结果 3,028
www.eeworm.com/read/100383/15875454

txt zz_p.txt

/**************************************************************************\ MODULE: ZZ_p SUMMARY: The class ZZ_p is used to represent integers mod p. The modulus p may be any positive
www.eeworm.com/read/427960/8909047

c mrsroot.c

/* * MIRACL method for modular square root * mrsroot.c * * Siguna Mueller's O(lg(p)^3) algorithm, Designs Codes and Cryptography, 2004 * * This is a little slower for p=1 mod 4
www.eeworm.com/read/185949/8971127

h zz_p.h

#ifndef NTL_ZZ_p__H #define NTL_ZZ_p__H #include #include NTL_OPEN_NNS // ZZ_p representation: each ZZ_p is represented by a ZZ in the range 0..p-1. // Th
www.eeworm.com/read/356815/10220776

h zz_p.h

#ifndef NTL_ZZ_p__H #define NTL_ZZ_p__H #include #include NTL_OPEN_NNS // ZZ_p representation: each ZZ_p is represented by a ZZ in the range 0..p-1. // Th
www.eeworm.com/read/353834/10414286

java millerrabin32.java

/* Copyright (c) 2008 the authors listed at the following URL, and/or the authors of referenced articles or incorporated external code: http://en.literateprograms.org/Miller-Rabin_primality_test_(Java
www.eeworm.com/read/160163/10562719

c dsa_make_key.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/349903/10785549

tpl mrcomba.tpl

/* * MIRACL Comba's method for ultimate speed modular multiplication * mrcomba.tpl * * See "Exponentiation Cryptosystems on the IBM PC", IBM Systems * Journal Vol. 29 No. 4 1990. Co
www.eeworm.com/read/136707/13364641

h zz_p.h

#ifndef NTL_ZZ_p__H #define NTL_ZZ_p__H #include #include NTL_OPEN_NNS // ZZ_p representation: each ZZ_p is represented by a ZZ in the range 0..p-1. // Th
www.eeworm.com/read/318176/13484172

c mrmonty.c

/* * MIRACL Montgomery's method for modular arithmetic without division. * mrmonty.c * * Programs to implement Montgomery's method * See "Modular Multiplication Without Trial Divisi
www.eeworm.com/read/100601/6267365

c mpmontg.c

/* * The contents of this file are subject to the Mozilla Public * License Version 1.1 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of