Bitwise relations between n and φ(n) : A novel approach at prime number factorization

Bitwise relations between n and φ(n) : A novel approach at prime number factorization

Cryptography plays a crucial role in today’s society. Given the influence, cryptographic algorithms need to be trustworthy. Cryptographic algorithms such as RSA relies on the problem of prime number factorization to provide its confidentiality. Hence finding a way to make it computationally feasible...

Full description

Bibliographic Details
Main Author: Jacobsson, Mattias
Format: Others
Language:English
Published: Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik 2018
Subjects:
bitwise relations
prime number factorization
Euler’s Totient function
RSA
Mathematics
Matematik
Computer and Information Sciences
Data- och informationsvetenskap
Probability Theory and Statistics
Sannolikhetsteori och statistik
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16655

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16655

Similar Items