eprintid: 6496
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/64/96
datestamp: 2023-11-09 16:18:17
lastmod: 2023-11-09 16:18:17
status_changed: 2023-11-09 16:06:54
type: conference_item
metadata_visibility: show
creators_name: Yusuf, B.K.
creators_name: Mahmood, A.K.
creators_name: Sulaiman, S.
title: Towards cryptanalysis of prime numbers
ispublished: pub
keywords: Information science; Linear regression; Public key cryptography; Regression analysis; Statistical tests, Algorithm analysis; Best model; Cubic function; Multiple linear regression analysis; Prime Pairs, Cryptography
note: cited By 0; Conference of 3rd International Conference on Computer and Information Sciences, ICCOINS 2016 ; Conference Date: 15 August 2016 Through 17 August 2016; Conference Code:125433
abstract: Natural numbers that defy decomposition into factors lower than themselves provide the basis for entrenching security in the public key encryption world. A variant algorithm of trial division of sieve of Eratosthenes, with its digits split into two unequal components and whose growth centered on displacement from its immediate neighbors (i.e., Polignac and Goldbach theorems) was fashioned out. As challenged by Euler's verdict on non-existence of a function that completely generates only primes, our formulation was based both upon multiple linear regression analysis hoping to find a multi-variate function, of degree at most 3, which can predict primes and comparison to Akaike Information Criterion (AIC) for model selection. About 20 billion lower primes of digits less than or equal 12 were subjected to various validation techniques (e.g., Sloane's A006988) and other heuristics for benchmarking purposes. Our results reveal certain desirable features illuminating prime patterns regardless of their chaotic camouflage. © 2016 IEEE.
date: 2016
publisher: Institute of Electrical and Electronics Engineers Inc.
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010402964&doi=10.1109%2fICCOINS.2016.7783294&partnerID=40&md5=9a5816f163eb089ae455d994441f37a6
id_number: 10.1109/ICCOINS.2016.7783294
full_text_status: none
publication: 2016 3rd International Conference on Computer and Information Sciences, ICCOINS 2016 - Proceedings
pagerange: 660-666
refereed: TRUE
isbn: 9781509051342
citation:   Yusuf, B.K. and Mahmood, A.K. and Sulaiman, S.  (2016) Towards cryptanalysis of prime numbers.  In: UNSPECIFIED.