Direct and inverse factorization algorithms of numbers

The factoring natural numbers into factors is a complex computational task. The complexity of solving this problem lies at the heart of RSA security, one of the most famous cryptographic methods. The classical trial division algorithm divides a given number N into all divisors, starting from 2 and t...

Full description

Bibliographic Details

Published in:	Lietuvos matematikos rinkinys Vol. 60; no. B; pp. 39 - 45
Main Author:	Melničenko, Grigorijus
Format:	Journal Article
Language:	English
Published:	Vilniaus universiteto leidykla / Vilnius University Press 05.12.2019 Vilnius University Press
Subjects:	Fermats factorization algorithm prime numbers trial division prime numbers Ferma skaidymo algoritmas trial division bandomoji dalyba pirminiai skaičiai Fermats factorization algorithm
ISSN:	0132-2818, 2335-898X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!