Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops

The aim of this paper is to propose the new initial value of Trial Division Algorithm (TDA) which is suitable for balanced modulus. The traditional initial value is ordinary ⌊√n⌋ where n is represented as modulus but the proposed value is always smaller than one. Moreover, it is still larger than a...

Full description

Bibliographic Details

Published in:	Proceedings of the ... International Joint Conference on Computer Science and Software Engineering (Online) pp. 143 - 147
Main Authors:	Somsuk, Kritsanapong, Chiawchanwattana, Thanapat, Sanemueang, Chalida
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2019
Subjects:	computation loops Elliptic curve cryptography Encryption Estimation Fermat's Factorization Algortithm (FFA) Information technology prime The initial value Trial Division Algorithm (TDA)
ISSN:	2642-6579
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!