• DocumentCode
    2106976
  • Title

    Recursive construction method of Boolean permutations

  • Author

    Zhang, Haimo

  • Author_Institution
    Huanghuai Univ., Zhumadian, China
  • fYear
    2010
  • fDate
    17-19 Dec. 2010
  • Firstpage
    362
  • Lastpage
    365
  • Abstract
    This paper proposes a new recursive method for constructing (n + 1)-bit Boolean permutations from n-bit ones, and proves that all (n + 1)-bit Boolean permutations can be constructed by the method, thereby solving enumeration problem of the kind of Boolean permutations. Furthermore, Boolean permutations with good cryptographic properties can be constructed by adding some restrictive conditions to the method.
  • Keywords
    Boolean functions; cryptography; recursive functions; Boolean permutations; cryptographic properties; enumeration problem solving; recursive construction method; Agricultural products; Logistics; Marketing and sales; Transportation; Boolean permutations; balanced function; recursive construction;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-6942-0
  • Type

    conf

  • DOI
    10.1109/ICITIS.2010.5689597
  • Filename
    5689597
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2106976