IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v9y2018i5d10.1007_s13198-018-0722-0.html
   My bibliography  Save this article

Optimal annihilator immunity with suboptimal bound of other properties

Author

Listed:
  • Rajni Goyal

    (University of Delhi, Delhi)

Abstract

In this paper we present constructions of Boolean functions based on the basic theory of annihilator immunity and bent functions. These constructions provide functions with the maximum possible annihilator immunity, and the nonlinearity and resiliency of the functions can also be calculated with specific cases. Here we have also described certain properties of Boolean functions that are necessary for resistance against algebraic and fast algebraic attacks. Annihilator immunity, nonlinearity and resiliency are important properties of a Boolean function to resist these attacks. There was no systematic attempt made to construct Boolean functions with maximum annihilator immunity that have good bound of nonlinearity and resiliency. We have constructed two different classes of desired Boolean functions through our newly developed method based on multiobjective optimization method(NSGA-II). In the first class, we have constructed bent functions(optimal nonlinearity) with sub-optimal bound of annihilator immunity while in other, Boolean functions having optimal bound of annihilator immunity with good bound of nonlinearity were developed. Our problem was multiobjective(nonlinearity, annihilator immunity and resiliency), hence a heuristic multiobjective optimization technique(NSGA-II) was used.

Suggested Citation

  • Rajni Goyal, 2018. "Optimal annihilator immunity with suboptimal bound of other properties," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(5), pages 1159-1164, October.
    • Handle: RePEc:spr:ijsaem:v:9:y:2018:i:5:d:10.1007_s13198-018-0722-0
    DOI: 10.1007/s13198-018-0722-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-018-0722-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-018-0722-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:9:y:2018:i:5:d:10.1007_s13198-018-0722-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.