Sciweavers

    2 search results - page 1 / 1
    » Low-Complexity Bit-Parallel Square Root Computation over GF(...
    Sort
    View
    TC
    2008
    109views Information Technology» more  TC 2008»
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    14 years 4 months ago
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    Download  eprint.iacr.org
    In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
    Francisco Rodríguez-Henríquez, Guill...
    claim paper
    Read More »
    DCC
    2007
    IEEE
    111views Computer Graphics» more  DCC 2007»
    Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
    15 years 4 months ago
    Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
    Download  eprint.iacr.org
    In this contribution, we derive a novel parallel formulation of the standard Itoh-Tsujii algorithm for multiplicative inverse computation over GF(2m). The main building blocks use...
    Francisco Rodríguez-Henríquez, Guillermo Morales...
    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-2025, USA.