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

Saved in:
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!
Abstract 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 smaller prime factor. That means some integers between the new initial value and ⌊√n⌋ are deleted from the computation. Therefore, the computation time is also decreased. In fact, the key to implement process is the way to choose both of initial values of Fermat's Factorization Algorithm (FFA) in order to apply with the proposed method. The reason is that half of the addition between both of them is always less than the higher prime factor. Hence, the first trial divisor from dividing n by the result is greater than the smaller factor. Therefore, it can be assigned as the new initial value for the implementation. The experimental results show that most of n can be factored with decreased loops whenever the new initial value is estimated. However, loops are stable for some values of n when the higher initial value of FFA is not changed.
AbstractList 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 smaller prime factor. That means some integers between the new initial value and ⌊√n⌋ are deleted from the computation. Therefore, the computation time is also decreased. In fact, the key to implement process is the way to choose both of initial values of Fermat's Factorization Algorithm (FFA) in order to apply with the proposed method. The reason is that half of the addition between both of them is always less than the higher prime factor. Hence, the first trial divisor from dividing n by the result is greater than the smaller factor. Therefore, it can be assigned as the new initial value for the implementation. The experimental results show that most of n can be factored with decreased loops whenever the new initial value is estimated. However, loops are stable for some values of n when the higher initial value of FFA is not changed.
Author Sanemueang, Chalida
Somsuk, Kritsanapong
Chiawchanwattana, Thanapat
Author_xml – sequence: 1
  givenname: Kritsanapong
  surname: Somsuk
  fullname: Somsuk, Kritsanapong
  email: kritsanapong@udru.ac.th
  organization: Faculty of Technology, Udon Thani Rajabhat University, UDRU, Udonthani, Thailand
– sequence: 2
  givenname: Thanapat
  surname: Chiawchanwattana
  fullname: Chiawchanwattana, Thanapat
  organization: Faculty of Technology, Udon Thani Rajabhat University, UDRU, Udonthani, Thailand
– sequence: 3
  givenname: Chalida
  surname: Sanemueang
  fullname: Sanemueang, Chalida
  organization: Office of Academic Resources and Information Technology, Udon Thani Rajabhat University, UDRU, Udonthani, Thailand
BookMark eNotUMFOAjEUrEYTAfkBvfQHFl9b2LZHXFExGA-gV9LdvkLNsiXbrsa_d42cZt5kZpI3Q3LRhAYJuWEwYQz03UuxXi8mHJieKJVPOVNnZMgkVwwk0_qcDHivZvlM6isyjvETAARTWjM9IGERkz-Y5JsdTXukDX7TZeOTNzX9MHWHNDi6af_OB__low8Nnde70Pq0P1AXWnpvatNUaOlrsF3dRZoCfcCqRRORFuFw7FJf38dWIRzjNbl0po44PuGIvD8uNsVztnp7WhbzVeY5iJTJUlvLcwdo5bTShrvKCnClQzsVgkHJmC1BSt37jCkBZja3PVc5dzq3SozI7X-vR8Ttse1_bH-2p33ELwe4Xb8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/JCSSE.2019.8864218
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 1728107199
9781728107196
EISSN 2642-6579
EndPage 147
ExternalDocumentID 8864218
Genre orig-research
GroupedDBID 6IE
6IF
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i203t-7b9dd26f0ed74c9a2fcd30fbfed43310b11db0779b9daab005d6db9d862f96d83
IEDL.DBID RIE
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000564537200025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:37:09 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-7b9dd26f0ed74c9a2fcd30fbfed43310b11db0779b9daab005d6db9d862f96d83
PageCount 5
ParticipantIDs ieee_primary_8864218
PublicationCentury 2000
PublicationDate 2019-July
PublicationDateYYYYMMDD 2019-07-01
PublicationDate_xml – month: 07
  year: 2019
  text: 2019-July
PublicationDecade 2010
PublicationTitle Proceedings of the ... International Joint Conference on Computer Science and Software Engineering (Online)
PublicationTitleAbbrev JCSSE
PublicationYear 2019
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003189919
Score 1.7377818
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 143
SubjectTerms computation loops
Elliptic curve cryptography
Encryption
Estimation
Fermat's Factorization Algortithm (FFA)
Information technology
prime
The initial value
Trial Division Algorithm (TDA)
Title Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops
URI https://ieeexplore.ieee.org/document/8864218
WOSCitedRecordID wos000564537200025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwGA3b8OBp6ib-5jt4tK7t1qY56n6gMsdgU3YbSZPMQm3G2vr3m6TbRPDipZSSEsj3PvKSvJcPoVvfZRJrYDgexdTpEUocqmGgH4wK6QfMZ_bK_DGeTKLFgkxr6G7vhRFCWPGZuDev9iyfq7g0W2WdKDK2zKiO6hiHlVdrv5-isampDtn5YlzSeenPZkMj3jJosD_-qqBiJ5BR839dH6H2jxMPpvs55hjVRHaCmrtSDLDNzBZSQ52qhnxmK9CUDjRZhmejC6IpvNO0FKAkzA3YYJBUfnJ4SFdqkxQfn6CJKzwajWMsOLwqXqZlDoWCgeWUuYCqQxtEGCu1ztvobTSc95-cbS0FJ_HdbuFgRjj3Q-kKjnsxob6MedeVTApuPFMu8zzOXIyJbkepyU1TaYpwveCRJORR9xQ1MpWJMwRYhNKLfckCInrck6RLQhYIP9ZBiAMSnKOWGb_lurouY7kduou_P1-iQxOiSgF7hRrFphTX6CD-KpJ8c2Nj_A0xcasZ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dT8IwFG0QTfQJFYzf3gcfnWxlX31UPgI6CAloeCPt2iIJUsI2f7_tBhgTX3xZlqVLk95z09P2nF6E7rHNZKCBYTk0oJZLKLGohoF-MCok9hhm-ZX5UTAYhJMJGZbQw84LI4TIxWfi0bzmZ_lcxZnZKquHobFlhnto33NdbBdurd2OikanJjtk64yxSf2lORq1jXzL4CH_9VcNlXwK6VT-1_kxqv148WC4m2VOUEksT1FlW4wBNrlZRaqtk9XQz-UMNKkDTZehZ5RBdAHvdJEJUBLGBm7QmheOcnhazNR6nn58gqau8GxUjrHg0Fc8W2QJpApaOatMBBQd5mGESKlVUkNvnfa42bU21RSsObYbqRUwwjn2pS144MaEYhnzhi2ZFNy4pmzmOJzZQUB0O0pNdppaU4TrJY8kPg8bZ6i8VEtxjiAQvnRiLJlHhMsdSRrEZ57AsQ5C7BHvAlXN-E1XxYUZ083QXf79-Q4ddsf9aBr1Bq9X6MiEq9DDXqNyus7EDTqIv9J5sr7N4_0NQUyuYA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+of+the+...+International+Joint+Conference+on+Computer+Science+and+Software+Engineering+%28Online%29&rft.atitle=Estimating+the+new+Initial+Value+of+Trial+Division+Algorithm+for+Balanced+Modulus+to+Decrease+Computation+Loops&rft.au=Somsuk%2C+Kritsanapong&rft.au=Chiawchanwattana%2C+Thanapat&rft.au=Sanemueang%2C+Chalida&rft.date=2019-07-01&rft.pub=IEEE&rft.eissn=2642-6579&rft.spage=143&rft.epage=147&rft_id=info:doi/10.1109%2FJCSSE.2019.8864218&rft.externalDocID=8864218