代码搜索：modulus
找到约 3,028 项符合「modulus」的源代码
代码结果 3,028
www.eeworm.com/read/169093/5428615
h xcr_random.h
/* Copyright 2003-2005, Voltage Security, all rights reserved.
*/
#include "ictk.h"
#ifndef XCR_RANDOM_H
#define XCR_RANDOM_H
#ifdef __cplusplus
extern "C" {
#endif
/* Generate sz byt
www.eeworm.com/read/395815/8151530
c ssl.c
/* -*- c-basic-offset: 8 -*-
rdesktop: A Remote Desktop Protocol client.
Secure sockets abstraction layer
Copyright (C) Matthew Chapman 1999-2007
Copyright (C) Jay Sorg 2006-2007
This
www.eeworm.com/read/294538/8220591
hpp modarith.hpp
/* modarith.hpp
*
* Copyright (C) 2003 Sawtooth Consulting Ltd.
*
* This file is part of yaSSL.
*
* yaSSL is free software; you can redistribute it and/or m
www.eeworm.com/read/102232/15789140
c 梯度.c
#include
#include
#include
#include
#define Len 100
#define Add 0.001
#define Times_Value 10
main()
{
int act=0;
int m;
int j;
int i;//变量个数
f
www.eeworm.com/read/102230/15789143
c tidu.c
#include
#include
#include
#include
#define Len 100
#define Add 0.001
#define Times_Value 10
main()
{
int act=0;
int m;
int j;
int i;//变量个数
f
www.eeworm.com/read/100767/15864601
h modexppc.h
#ifndef CRYPTOPP_MODEXPPC_H
#define CRYPTOPP_MODEXPPC_H
#include "modarith.h"
#include "eprecomp.h"
#include "smartptr.h"
NAMESPACE_BEGIN(CryptoPP)
//! .
class ModExpPrecomputation
{
pu
www.eeworm.com/read/100612/15868903
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/100605/15869950
cpp barrett.cpp
/*************************************************
* Barrett Reducer Source File *
* (C) 1999-2002 The Botan Project *
***********************************************
www.eeworm.com/read/100478/15873319
h modexppc.h
#ifndef CRYPTOPP_MODEXPPC_H
#define CRYPTOPP_MODEXPPC_H
#include "modarith.h"
#include "eprecomp.h"
#include "smartptr.h"
NAMESPACE_BEGIN(CryptoPP)
class ModExpPrecomputation
{
public:
www.eeworm.com/read/276812/10706590