加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds]
標簽： Cryptographic Primitives generate Library
上傳時間： 2015-07-16
上傳用戶：wqxstar
crc任意位生成多項式 任意位運算 自適應算法 循環冗余校驗碼(CRC，Cyclic Redundancy Code)是采用多項式的 編碼方式，這種方法把要發送的數據看成是一個多項式的系數 ，數據為bn-1bn-2…b1b0 (其中為0或1)，則其對應的多項式為： bn-1Xn-1+bn-2Xn-2+…+b１X+b０ 例如：數據“10010101”可以寫為多項式 X７+X４+X２+1。 循環冗余校驗CRC 循環冗余校驗方法的原理如下： (1) 設要發送的數據對應的多項式為P(x)。 (2) 發送方和接收方約定一個生成多項式G(x)，設該生成多項式 的最高次冪為r。 (3) 在數據塊的末尾添加r個0，則其相對應的多項式為M(x)=XrP(x) 。(左移r位) (4) 用M(x)除以G(x)，獲得商Q(x)和余式R(x)，則 M(x)=Q(x) ×G(x)+R(x)。 (5) 令T(x)=M(x)+R(x)，采用模2運算，T(x)所對應的數據是在原數 據塊的末尾加上余式所對應的數據得到的。 (6) 發送T(x)所對應的數據。 (7) 設接收端接收到的數據對應的多項式為T’(x)，將T’(x)除以G(x) ，若余式為0，則認為沒有錯誤，否則認為有錯。
上傳時間： 2014-11-28
上傳用戶：宋桃子
It is possible that certain products which can be built using this software modules might form inventions protected by patent rights in some countries (e.g. by patents about arithmetic coding algorithms owned by IBM and AT&T in the USA). Provision of this software by the author does NOT include any licenses for any patents. In those countries where a patent license is required for certain applications of this software modules, you will have to obtain such a license yourself.
標簽： possible products software certain
上傳時間： 2015-09-02
上傳用戶：gut1234567
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
Programmed for Atmel STK-500 development board, detalis can be found at http://www.cs.hut.fi/Studies/T-106.5300/2007/stk500.html
標簽： development Programmed Studies detalis
上傳時間： 2013-12-18
上傳用戶：waitingfy
BNB20 Finds the constrained minimum of a function of several possibly integer variables. ％ Usage: [errmsg,Z,X,t,c,fail] = ％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) ％ ％ BNB solves problems of the form: ％ Minimize F(x) subject to: xlb <= x0 <=xub ％ A*x <= B Aeq*x=Beq ％ C(x)<=0 Ceq(x)=0 ％ x(i) is continuous for xstatus(i)=0 ％ x(i) integer for xstatus(i)= 1 ％ x(i) fixed for xstatus(i)=2 ％
標簽： constrained variables function possibly
上傳時間： 2014-01-13
上傳用戶：youth25
生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test
標簽： distributions top_distrib Bipartite Graphs
上傳時間： 2015-10-02
上傳用戶：yy541071797
palm編成,這種書很少,有興趣看看 Title: Palm Programming: The Developer s Guide URL: http://safari.oreilly.com/JVXSL.asp?x=1&mode=section&sortKey=rank&sortOrder=desc&view=book&xmlid=1-56592-525-4&open=false&srchText=palm+programming&code=&h=&m=&l=1&catid=&s=1&b=1&f=1&t=1&c=1&u=1&page=0 ISBN: 1-56592-525-4 Author: Julie McKeehan/ Neil Rhodes Publisher: O Reilly Page: 478 Edition: 1st edition (December 1998) Catalog: PDA programming / Palm Format: pdf Size: 2.06M Supplier: Summary: Emerging as the bestselling hand-held computers of all time, PalmPilots have spawned intense developer activity and a fanatical following. Used by Palm in their developer training, this tutorial-style book shows intermediate to experienced C programmers how to build a Palm application from the ground up. Includes a CD-ROM with source code and third-party developer tools
標簽： Programming Developer oreilly safari
上傳時間： 2013-12-10
上傳用戶：litianchu
madCollection 2.5.2.6 full source This is not your every day VCL component collection. You won t see many new colored icons in the component palette. My packages don t offer many visual components to play with. Sorry, if you expected that! My packages are about low-level stuff for the most part, with as easy handling as possible. To find the hidden treasures, you will have to look at the documentation (which you re reading just in the moment). Later I plan on writing some nice demos, but for now the documentation must be enough to get you started.
標簽： madCollection collection component source
上傳時間： 2014-01-18
上傳用戶：yoleeson
假定已經有許多應用采用了程序1 - 1 5中所定義的C u r r e n c y類，現在我們想要對C u r r e n c y類 的描述進行修改，使其應用頻率最高的兩個函數A d d和I n c r e m e n t可以運行得更快，從而提高應 用程序的執行速度。由于用戶僅能通過p u b l i c部分所提供的接口與C u r r e n c y類進行交互，
上傳時間： 2015-10-11
上傳用戶：BIBI
