Sciweavers

Share ➚
PKC
2009
Springer
55views Cryptology» more  PKC 2009»
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
2 years 6 months ago
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
Download  www.cits.rub.de
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...
Alexander May, Maike Ritzenhofen
claim paper
Read More »
Spread the Word
Explore & Download
Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
Productivity Tools
International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
Document Tools
PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
Image Tools
JPG to PS JPG to PDF Extract Images from PDF Image Converter
Sciweavers
About Community Report Bug Request Feature Privacy Policy Terms of Use Contact

Copyright © 2009-2011 Sciweavers LLC. All rights reserved.

books