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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the ... International Joint Conference on Computer Science and Software Engineering (Online) s. 143 - 147
Hlavní autori:	Somsuk, Kritsanapong, Chiawchanwattana, Thanapat, Sanemueang, Chalida
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.07.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!