Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)

From MaRDI portal
Publication:604101
Jump to:navigation, search

DOI10.1016/j.camwa.2010.01.020zbMath1198.94134OpenAlexW2080415500MaRDI QIDQ604101

Sang-Soo Yeo, Sajid Hussain, Li Xu, Laurence Tianruo Yang

Publication date: 8 November 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.01.020


zbMATH Keywords

Lanczos methodparallelizationhigh performance computinginteger factorizationGNFS algorithmlinear system over \(GF(2)\)public-key RSA algorithm


Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)


Related Items (2)

An improved parallel block Lanczos algorithm over GF(2) for integer factorization ⋮ Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing


Uses Software

  • gmp
  • LinBox
  • MPI


Cites Work

  • Factoring integers with elliptic curves
  • A design for a number theory package with an optimized trial division routine
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:604101&oldid=12491558"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 08:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki