Sciweavers

    21 search results - page 3 / 5
    » Costas array generator polynomials in finite fields
    Sort
    View
    TIT
    2008
    164views more  TIT 2008»
    Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
    13 years 5 months ago
    Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
    Download  eprint.iacr.org
    We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
    Aggelos Kiayias, Moti Yung
    claim paper
    Read More »
    AUTOMATICA
    2008
    126views more  AUTOMATICA 2008»
    Local stability analysis using simulations and sum-of-squares programming
    13 years 5 months ago
    Local stability analysis using simulations and sum-of-squares programming
    Download  jagger.berkeley.edu
    The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
    Ufuk Topcu, Andrew K. Packard, Peter Seiler
    claim paper
    Read More »
    DCC
    2010
    IEEE
    134views Computer Graphics» more  DCC 2010»
    Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
    13 years 5 days ago
    Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
    Download  www.math.clemson.edu
    Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
    Nathan Drake, Gretchen L. Matthews
    claim paper
    Read More »
    ASIACRYPT
    2006
    Springer
    183views Cryptology» more  ASIACRYPT 2006»
    The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
    13 years 9 months ago
    The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
    Download  www.ens-lyon.fr
    Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
    Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
    claim paper
    Read More »
    STOC
    2009
    ACM
    156views Algorithms» more  STOC 2009»
    Polynomial-time theory of matrix groups
    14 years 5 months ago
    Polynomial-time theory of matrix groups
    Download  people.cs.uchicago.edu
    We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
    László Babai, Robert Beals, Á...
    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.