• DocumentCode
    804937
  • Title

    Keys Don´t Grow in Threes

  • Author

    Farrell, Stephen

  • Author_Institution
    Trinity Coll. Dublin, Dublin
  • Volume
    13
  • Issue
    3
  • fYear
    2009
  • Firstpage
    96
  • Lastpage
    95
  • Abstract
    Many Internet security mechanisms depend on the use of cryptographic algorithms for various forms of authentication and confidentiality. Even when well-known and standardized cryptographic algorithms are used in well-known protocols, some parameters must be specified, the most important of which are usually algorithm identifiers and key or hash-output lengths. The author reviews some recent key length recommendations and compares those to current usage. He raises some issues that come up once we start to do the updates called for by various cryptographic experts and authorities who´ve made recommendations on this topic - some of which call for widespread changes to occur in 2010.
  • Keywords
    Internet; cryptography; Internet security mechanisms; cryptographic algorithms; cryptographic experts; Algorithm design and analysis; Art; Bandwidth; Cryptography; Educational institutions; Internet; Moore´s Law; Security; cryptographic key length; key size; key update; peering; practical security; security;
  • fLanguage
    English
  • Journal_Title
    Internet Computing, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7801
  • Type

    jour

  • DOI
    10.1109/MIC.2009.64
  • Filename
    4907694