CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
One approach to factorization of positive integers
Authors
Boiko A.
Ishmukhametov S.
Ziyatdinov D.
Publication date
1 January 2011
Publisher
Abstract
Factorization of positive integers into primes is a hard computational task. Its complexity lies in the base of the most popular method of cryptography, the RSA method. In this paper we propose a new technique in a factorization procedure which combines ideas of the Number Field Sieve (NFS) and the Quadratic Sieve (QS) in a special manner. © Allerton Press, Inc., 2011
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/97889
Last time updated on 07/05/2019
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/138252
Last time updated on 07/05/2019