加密算法 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]
標(biāo)簽： Cryptographic Primitives generate Library
上傳時(shí)間： 2015-07-16
上傳用戶：wqxstar
solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library Output.
標(biāo)簽： Definitely algorithm problem include
上傳時(shí)間： 2014-01-17
上傳用戶：zm7516678
工程計(jì)算MATLAB code to calculate the reorthogonalized sine tapers input: N = the length of the time series data to be tapered p = the number of tapers requested I = the gap structure a vector of length N I(t) = 1 if there is data at time t, t=1, ..., N I(t) = 0 if there is a gap at time t Output: X = N-by-p vector of the reorthogonalized sine taper
標(biāo)簽： the reorthogonalized calculate MATLAB
上傳時(shí)間： 2013-12-17
上傳用戶：wangyi39
his project was built and tested with WinAVR-20060125. Make sure the MCU target define in the Makefiles corresponds to the AVR you are using!! To build the code, just install WinAVR and run "make" from the console in echomaster and echoslave subdirs. "make program" will program the device if you have a AVRISP attached. Remember to set the AVR device to at least 8MHz. The AVR may use the programmable clock from MC1319x, just remember to check if the MC1319x and SPI communication is working FIRST! Otherwise you wont get any clock signal to the AVR and then you can t program it or reset the fuses! The MC1319x has default clock Output of 32kHz so you will have to set your programmer to a very low frequency (<=32kHz/4) to be able to program it while it is running on that!
標(biāo)簽： the 20060125 project WinAVR
上傳時(shí)間： 2014-10-10
上傳用戶：yan2267246
Test program to loop on Successive Approximation A-to-D conversion. Allows digital codes and resulting DAC Output to be viewed on scope.
標(biāo)簽： Approximation Successive conversion program
上傳時(shí)間： 2015-08-07
上傳用戶：頂?shù)弥?/p>
8點(diǎn)基二fft Fast Fourier Transform (FFT). Using 8 points, takes about 1.2 ms to execute one FFT. Sets up General Purpose Timer 1 to generate events at 10 kHz. Will produce 10 kHz Output on T1PWM and T1PWM pins.
標(biāo)簽： FFT Transform Fourier execute
上傳時(shí)間： 2013-12-18
上傳用戶：Yukiseop
The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers, CRC Press, 1993, contains an FDTD code and Output files in Appendix B. The same code and Output files are contained in this directory.
標(biāo)簽： Electromagnetics Difference The Luebbers
上傳時(shí)間： 2013-12-29
上傳用戶：chongcongying
EXAMPLE SOURCE CODE FOR IMPLIB FILTER This filter accepts input through the standard input stream, convertsit and Outputs it to the standard Output am. The streams are linkedthrough pipes, such that the input stream is the Output from the import librarian being invoked, and the Output stream is connected to the message window of the IDE, ie.
標(biāo)簽： input standard EXAMPLE accepts
上傳時(shí)間： 2014-11-18
上傳用戶：siguazgb
EXAMPLE SOURCE CODE FOR TASM FILTER his filter accepts input through the standard input stream, converts it and Outputs it to the standard Output stream. The streams are linked through pipes, such that the input stream is the Output from the assembler being invoked, and the Output stream is connected to the message window of the IDE, ie.
標(biāo)簽： input standard EXAMPLE accepts
上傳時(shí)間： 2014-01-13
上傳用戶：小碼農(nóng)lz
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * Output: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
標(biāo)簽： APPROXIMATE ALGORITHM THE SOLUTION
上傳時(shí)間： 2015-08-20
上傳用戶：zhangliming420
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
