Primality Testing and Integer Factorization in Public-Key Cryptography
Song Y. Yan
TL;DR: The paper covers topics in computer and network security, including primality testing and integer factorization, and aims to establish the state of the art and set the course for future research.
read more
Abstract: SECURITY are, one, to establish the state of the art of, and set the course for future research in information security and, two, to serve as a central reference source for advanced and timely topics in information security research and development.The scope of this series includes all aspects of computer and network security and related areas such as fault tolerance and software assurance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Quantum Computational Number Theory
Song Y. Yan
- 26 Dec 2015
TL;DR: This paper presents a meta-modelling scheme that automates the very labor-intensive and therefore time-heavy and expensive process of integrating discrete logarithms into a discrete-time model.
17
•Book
Cybercryptography: Applicable Cryptography for Cyberspace Security
Song Y. Yan
- 21 Jan 2019
TL;DR: It is shown that quantum theory and the ‘universal quantum computer’ are compatible with the principle, and a class of model computing machines that is the quantum generalization of the class of Turing machines is described.
12
Fermat Factorization using a Multi-Core System
TL;DR: This study investigates the performance of the Fermat factorization algorithm using three parameters: the number of bits for the composite odd integer, size of the difference between the two prime factors, and number of threads used, and finds that the running time of the parallel FF algorithm is faster than that of the sequential FF algorithm.
Factoring Based Cryptography
Song Y. Yan
- 01 Jan 2019
TL;DR: This chapter discusses various factoring based cryptographic systems and protocols in the context of public-key cryptography.
9
Modified Multi Prime RSA Cryptosystem
M. Ghazali Kamardan,N Aminudin,Norziha Che-Him,Suliadi Sufahani,Kamil Khalid,Rozaini Roslan +5 more
- 01 Apr 2018
TL;DR: Since Multi prime RSA use more than two prime numbers, the algorithm is more efficient and secure when compared to the standard RSA and another secret key is introduced to increase the obstacle to the attacker.
9
References
Primality Testing and Prime Generation
Song Y. Yan,Song Y. Yan +1 more
- 01 Jan 2009
TL;DR: The primality testing problem (PTP) may be described as the following simple decision (i.e., yes/no) problem: ======\/\/\/\/\/\/\/\/\/\/\/£££ £££•££
1