• DocumentCode
    2574168
  • Title

    Cryptography and decoding Reed-Solomon codes as a hard problem

  • Author

    Kiayias, Aggelos ; Yung, Moti

  • Author_Institution
    Connecticut Univ., Storrs, CT
  • fYear
    2005
  • fDate
    19-19 Oct. 2005
  • Firstpage
    48
  • Lastpage
    48
  • Abstract
    Some recent developments in employing Reed-Solomon codes in cryptography are surveyed, including the design of symmetric ciphers and what provable properties one can argue based on suitable hardness assumptions (for parameters where decoding is hard)
  • Keywords
    Reed-Solomon codes; cryptography; decoding; Reed-Solomon codes decoding; cryptography; symmetric ciphers; Cryptography; Decoding; Equations; Fitting; Galois fields; Laboratories; Polynomials; Reed-Solomon codes; Security;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Theory and Practice in Information-Theoretic Security, 2005. IEEE Information Theory Workshop on
  • Conference_Location
    Awaji Island
  • Print_ISBN
    0-7803-9491-7
  • Type

    conf

  • DOI
    10.1109/ITWTPI.2005.1543956
  • Filename
    1543956
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2574168