• DocumentCode
    972533
  • Title

    Encryption with keyed random permutations

  • Author

    Ayoub, F.

  • Author_Institution
    Hatfield Polytechnic, Department of Electrical Engineering, Hatfield, UK
  • Volume
    17
  • Issue
    17
  • fYear
    1981
  • Firstpage
    583
  • Lastpage
    585
  • Abstract
    A method is presented to generate a keyed random permutation (for example when enciphering a block of binary data) using the theoretical minimum number of key bits. The method is especially useful in an environment with limited key supply. An algorithm for implementing the method is given, with an estimate of its complexity.
  • Keywords
    cryptography; computational complexity; encryption; keyed random permutations;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19810411
  • Filename
    4245887
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=972533