Search - miller

[source in ebook] MATLAB

Description: miller编码在matlab上的简单实现函数-miller coding simple implementation
Platform: | Size: 1024 | Author: 全嘉林 | Hits:

Description: Fermat primality test. most applications use a Miller-Rabin or Baillie-PSW test for primality. Sometimes a Fermat test (along with some trial division by small primes) is performed first to improve performance. GMP since version 3.0 uses a base-210 Fermat test after trial division and before running Miller-Rabin tests. Libgcrypt uses a similar process with base 2 for the Fermat test, but OpenSSL does not.
Platform: | Size: 1024 | Author: Beforavy | Hits:

[Software Engineering] RFID

Description: 涉及超高频射频识别技术数字基带领域，更具体的，涉及一种可进行基带信号频偏估计的米勒码的快速解码方法。-UHF radio frequency identification technology involves the digital baseband, and more particularly, relates to a baseband signal frequency estimation of rapid decoding method Miller codes.
Platform: | Size: 270336 | Author: 赵伟 | Hits:

[Crack Hack] RSA

Description: 利用C\C++实现RSA算法的加、解密运算。具体包括： 1）利用扩展的Euclid计算 a mod n 的乘法逆元； 2）Miller-Rabin素性测试算法对一个给定的大数进行测试； 3）实现的运算，并计算； 4）利用Euler定理手工计算，并与3）计算的结果对比； 5）实现RSA算法。并对 I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS 加解密。说明：为了方便实现，分组可以小一点，比如两个字母一组。字母及其数字编码字母及其数字编码空格 00 N 14 A 01 O 15 B 02 P 16 C 03 Q 17 D 04 R 18 E 05 S 19 F 06 T 20 G 07 U 21 H 08 V 22 I 09 W 23 J 10 X 24 K 11 Y 25 L 12 Z 26 M 13 -Use of C \ C++ implements the RSA algorithm encryption and decryption operations. These include: 1) using the extended Euclid calculate a mod n multiplicative inverse 2) Miller-Rabin primality testing algorithm for a given test large numbers 3) to achieve the operation, and the calculation 4) the use of Euler Theorem manual calculation, and compared with the results of the calculation 3) 5) implement the RSA algorithm. And I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS encryption and decryption. Description: In order to facilitate the achievement of the packet may be smaller, for example, a group of two letters. Alphabet letters and their digital encoding and digital encoding Spaces 00 N 14 A 01 O 15 B 02 P 16 C 03 Q 17 D 04 R 18 E 05 S 19 F 06 T 20 G 07 U 21 H 08 V 22 I 09 W 23 J 10 X 24 K 11 Y 25
Platform: | Size: 1024 | Author: 刘洋 | Hits:

[Algorithm] miller_rabin

Description: Miller-Rabin质数测试输入第1行：1个正整数t，表示数字的个数，10≤t≤50 第2..t+1行：每行1个正整数，第i+1行表示正整数a[i]，2≤a[i]≤10^18 输出第1..t行：每行1个字符串，若a[i]为质数，第i行输出 Yes ，否则输出 No -Miller-Rabin primality test input The first line: 1 positive integer T, said a number of figures, 10 t 50 Line 2..T+1: each line of 1 positive integers, i+1 expressed a positive integer a[i], 2 a[i] 10^18 output Line 1..T: 1 string per line, if a[i] is a prime number, the I output Yes , otherwise output No
Platform: | Size: 1792000 | Author: 李慧林 | Hits:

[VHDL-FPGA-Verilog] XuLie

Description: 序列检测机，可检测8位数字序列，米勒型状态机-Sequence detector can detect 8-digit sequence, Miller-type state machine
Platform: | Size: 3127296 | Author: 赵嘉楠 | Hits:

[Other] MILEIXIAOYING

Description: 此文件分析MOS在驱动电动车时候的米勒效应，如何减少米勒效应时间是电动车驱动的一个重要指标。-This document analyzes MOS driving electric cars when the Miller effect, how to reduce the Miller effect time is an important indicator of electric vehicle drive.
Platform: | Size: 12288 | Author: 谭人之 | Hits:

[Algorithm] Miller_Prime

Description: Miller-Rabin 素性检测能够快速地对一个整数进行素性检测-Miller-Rabin primality testing can be carried out quickly to an integer primality testing
Platform: | Size: 1024 | Author: 陈越 | Hits:

[OS program] Applet--06032MILLER-8705570

Description: 一个不错的源码 Applet 06032MILLER-8705570，今天愿与各位同学们共同学习参考使用-A good source Applet- miller, 06032-06032, today let the students study together with you
Platform: | Size: 6144 | Author: JAH-345 | Hits:

[OS program] teexrticle

Description: Miller An article on an easy and neat way to include options-Miller, An article on the An easy and neat way to include the options
Platform: | Size: 185344 | Author: Amyerya | Hits:

[ADO-ODBC] lmareraskpipeline

Description: 一个Web爬虫Java类库,最初由Carnegie Mellon 大学的Robert Miller开发,-A Web crawler Java class library, originally developed by Carnegie Mellon university s Robert Miller,
Platform: | Size: 295936 | Author: hhsy@604443 | Hits:

[CA auth] prob3

Description: Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to answer each of the below questions. (a) Given a positive integer N, check whether it is prime or not. 1-1• Input: N • Output: Prime or Not • For example, Input: 31 • Output: prime (b) Given a positive integer N, find the smallest prime greater than N. • Input: N • Output: M • Example: Input: 25 • Output: 29 (c) For a composite number, N = 221 (13 ×17), Miller-Rabin test outputs N = 221 as ‘prime’ for a = 174. Such a are known as strong liars. Find all other strong liars for the N = 221. Similarly, for a = 137 , it shows that N = 221 is composite. Such a’s are known as strong witness of compositeness. Find other strong witnesses if any.-Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to answer each of the below questions. (a) Given a positive integer N, check whether it is prime or not. 1-1• Input: N • Output: Prime or Not • For example, Input: 31 • Output: prime (b) Given a positive integer N, find the smallest prime greater than N. • Input: N • Output: M • Example: Input: 25 • Output: 29 (c) For a composite number, N = 221 (13 ×17), Miller-Rabin test outputs N = 221 as ‘prime’ for a = 174. Such a are known as strong liars. Find all other strong liars for the N = 221. Similarly, for a = 137 , it shows that N = 221 is composite. Such a’s are known as strong witness of compositeness. Find other strong witnesses if any.
Platform: | Size: 1024 | Author: jitender grover | Hits:

[JSP/Java] 9555149

[JSP/Java] librarz

Description: 一个Web爬虫Java类库,最初由Carnegie Mellon 大学的Robert Miller开发,(A Web crawler Java class library, originally developed by Carnegie Mellon university's Robert Miller,)
Platform: | Size: 467968 | Author: dpfino | Hits:

[RFID] Miller

Description: 实现米勒编码()
Platform: | Size: 397312 | Author: 安小久 | Hits:

[ComboBox] IDXWOPY96

Description: Miller An article on an easy and neat way to include options(Miller, An article on the An easy and neat way to include the options)
Platform: | Size: 340992 | Author: EFBB%21264592 | Hits:

[Other] sewializtfion

Description: 一个Web爬虫Java类库,最初由Carnegie Mellon 大学的Robert Miller开发,()
Platform: | Size: 294912 | Author: Ilzfv | Hits:

[ComboBox] lannuage

Description: Miller An article on an easy and neat way to include options()
Platform: | Size: 186368 | Author: weqy%5F2526 | Hits:

[Windows Develop] dwgaqiredirected

Description: 一个Web爬虫Java类库,最初由Carnegie Mellon 大学的Robert Miller开发,()
Platform: | Size: 294912 | Author: forejm | Hits:

[DataMining] gemhyr

Description: 这是个很容易且广泛使用的简单算法,它基于Gary Miller的部分象法,有Michael Rabin发展,事实上,这是在()
Platform: | Size: 216064 | Author: Evosltw | Hits:

« 1 2 ... 5 6 7 8 9 1011 »

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list