The Strong Prime Numbers Generation Algorithm Based on Genetic Algorithm

Zhi Hua Hu; Qing Zhang

doi:10.4028/www.scientific.net/AMM.220-223.2963

Paper Titles

VLAN Technology Application Research Based on Campus Network Security
p.2945

Study of Digital Campus Construction and Application
p.2949

Study on Campus Network Security and Protection Technology
p.2955

Dynamic Visualization of Urban Changes Based on Flex
p.2959

The Strong Prime Numbers Generation Algorithm Based on Genetic Algorithm
p.2963

Survey to Automobile Electromagnetic Compatibility Simulation Software
p.2968

Micro-Macro Modeling for Systems Biology with MR-DEVS
p.2975

New Spectral Indices as Indicators of Carotenoids Content
p.2983

Using DNA to Solve the Minimal Vertex Covering Problem
p.2987

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 220-223The Strong Prime Numbers Generation Algorithm...

The Strong Prime Numbers Generation Algorithm Based on Genetic Algorithm

Abstract:

Large prime number generation methods in need of a more complex modular exponentiation, leading to defects of slower computing speed, Based on this genetic algorithm, proposed a new strong prime number generated algorithm. The method according to the characteristics of Strong Primes, the algorithm is simple, easy to implement to meet the needs of the RSA algorithm security , giving the method of determining the large prime numbers. Design fitness function , crossover and mutation strategies which can be used in genetic algorithm. Finally design the algorithm of producing Strong prime numbers

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 220-223)

Pages:

2963-2967

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.220-223.2963

Citation:

Cite this paper

Online since:

November 2012

Authors:

Zhi Hua Hu, Qing Zhang

Keywords:

Genetic Algorithm (GA), Large Prime Numbers, RSA

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Menezes Alf red J ,Van Oorschot Paul C ,Vanstone ScottA. Handbook of applied cryptography [M] . Beijing : Publishing House of Elect ronics Indust ry ,2005 :6.

Google Scholar

[2] Miller G L. Riemann's Hypothesis and test s for primality[J] . Journal of Computation and System Science , 1976 ,13 :300 - 317.

Google Scholar

[3] Rabin M O. Probabilistic algorithm for testing primality[J].Journal of Number Theory ,1980 ,12 :128 - 138.

DOI: 10.1016/0022-314x(80)90084-0

Google Scholar

[4] Jing Weiping, Chen Haijin. Both large prime numbers analysis and comparison of search methods [J]. Computer Engineering, 2001,27 (12) :106-107.

Google Scholar

[5] BANZHAF W ，NORDIN P，KELLER R E，et a1．Genetic programming： an introduction on the automatic evolution of computer program sand its applications[M]． Morgan Kaufmann Publishers。1998．

Google Scholar

[6] Goce Jakimoski and Ljupco Kocarev Chaos and Crypto-graph : Block Encryption Ciphers Based on Chaotic Maps, IEEE Transactions on circuits and systems - I : Fundamental theory and applications ,Vol. 48 ,No. 2 ,(2001)

DOI: 10.1109/81.904880

Google Scholar

[7] ZENDEHBUDI G R, MOAYERI M S. Comparison ofphysiological and simple pulsatile flows through stenosed arteries[ J] . J Biomech, 1999, 32: 959- 965.

DOI: 10.1016/s0021-9290(99)00053-6

Google Scholar

[8] BERTOLOTTI C, DEPLANO V. Three-dimensional numerical simulations of flow through a stenosed coronary bypss[ J] . J Biomech, 2000, 33: 1011- 1022.

DOI: 10.1016/s0021-9290(00)00012-9

Google Scholar