Sciweavers

    IJNSEC
    2010
    324views more  IJNSEC 2010»
    Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
    13 years 6 months ago
    Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
    Download  ijns.femto.com.tw
    Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
    Rajaram Ramasamy, Amutha Prabakar Muniyandi
    claim paper
    Read More »
    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 Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.