Cryptographic Boolean Functions and Applications

被引:0
|
作者
Joyner, David [1 ]
机构
[1] US Naval Acad, Annapolis, MD 20402 USA
关键词
D O I
10.1080/01611194.2013.767683
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
[No abstract available]
引用
收藏
页码:189 / 192
页数:4
相关论文
共 50 条
  • [2] Generation of Boolean Functions Using Genetic Algorithm for Cryptographic Applications
    Asthana, Rajesh
    Verma, Neelam
    Ratan, Ram
    SOUVENIR OF THE 2014 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2014, : 1361 - 1366
  • [3] On cryptographic complexity of Boolean functions
    Carlet, C
    FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
  • [4] On the annihilators of cryptographic Boolean functions
    State Key Lab. of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
    不详
    不详
    Tien Tzu Hsueh Pao, 2006, 1 (51-54):
  • [5] Cryptographic Boolean Functions with R
    Lafitte, Frederic
    Van Heule, Dirk
    Van Hamme, Julien
    R JOURNAL, 2011, 3 (01): : 44 - 47
  • [6] Metaheuristics in the Optimization of Cryptographic Boolean Functions
    Lopez-Lopez, Isaac
    Sosa-Gomez, Guillermo
    Segura, Carlos
    Oliva, Diego
    Rojas, Omar
    ENTROPY, 2020, 22 (09)
  • [7] Cryptographic Boolean functions with biased inputs
    Gangopadhyay, Sugata
    Gangopadhyay, Aditi Kar
    Pollatos, Spyridon
    Stanica, Pantelimon
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (02): : 301 - 314
  • [8] On cryptographic propagation criteria for Boolean functions
    Carlet, C
    1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 148 - 149
  • [9] Properties of a family of cryptographic boolean functions
    Wang, Qichun
    Tan, Chik How
    Wang, Qichun, 1600, Springer Verlag (8865): : 34 - 46
  • [10] Cryptographic Boolean functions with biased inputs
    Sugata Gangopadhyay
    Aditi Kar Gangopadhyay
    Spyridon Pollatos
    Pantelimon Stănică
    Cryptography and Communications, 2017, 9 : 301 - 314