rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Analysis and synthesis of cryptographic Boolean functions in Haar domain
  name:
    name part: Rafiq, Hashum Mohamed
    role:
      role term: creator
    role:
      role term: author
  name:
    name part: International Islamic University Malaysia
    name part: Kulliyyah of Engineering
  genre: Theses, IIUM local
  origin info:
    place:
      place term: my
    date issued: 2017
  language:
    language term: eng
  physical description:
    extent: xxii, 316 leaves : illustrations ; 30cm.
  abstract: Cryptographic Boolean functions serve as an integral part of symmetric-key ciphers. A strong cipher requires that the underlying functions meet specific security criteria. Traditionally, the Walsh transform and autocorrelation function of Boolean functions have been deployed as the main tools for studying whether such functions meet the desired criteria. This thesis introduces the Haar transform as an alternative tool for studying cryptographic Boolean functions. The thesis presents Haar analysis and synthesis (construction) of cryptographically significant functions, including their related application specific designs. The study parallels with the earlier ones based on the Walsh domain approach. For the analysis part, the work begins by establishing the missing connections between the Haar, Walsh, and autocorrelation spectra. This stage presents new Haar representations of the Walsh-Paley transform and autocorrelation function, along with the related connection to the power spectrum. Using the Walsh analogy, the work then proceeds to derive the Haar based measures for the main cryptographic criteria including; Hamming distance and weight, balancedness, bentness, nonlinearity, correlation immunity, resiliency, strict-avalanche, global-avalanche and propagation criteria. The work presents the Haar general formulation and representation of all the stated criteria. The synthesis part is divided into two sub-parts related to testing and construction algorithms. The former introduces Haar based algorithms for testing and measuring main cryptographic criteria. The latter includes algorithms in two forms of Haar stochastic multistage search and Haar spectrum manipulation techniques. Both of these algorithms work on modifying bent functions to yield optimum functions with desired trade-off between criteria. This part also presents the simulation results of the Haar based algorithms in comparison to the existing benchmarks. The last part of the work involves deploying the s…
  note: by Hashum Mohamed Rafiq
  note: Thesis (Ph.D)--International Islamic University Malaysia, 2017.
  note: Includes bibliographical references (leaves 250-275).
  subject:
    geographic code: a-my---
  classification: QA10.3
  identifier: http://studentrepo.iium.edu.my/handle/123456789/5226
  record info:
    record content source: UIAM
    record creation date: 170606
    language of cataloging:
      language term: eng