Suchergebnisse - "Multi-output Boolean functions"

  1. 1

    Quantum cryptographic property testing of multi-output Boolean functions von Cui, Jingyi, Guo, Jiansheng

    ISSN: 1570-0755, 1573-1332
    Veröffentlicht: New York Springer US 01.06.2019
    Veröffentlicht in Quantum information processing (01.06.2019)
    “… Compared with Boolean functions, multi-output Boolean functions (a.k.a. vectorial Boolean functions …”
    Volltext
    Journal Article
  2. 2

    RECURSIVE TERNARY-BASED ALGORITHM FOR COMPUTING PRIME IMPLICANTS OF MULTI-OUTPUT BOOLEAN FUNCTIONS von Al-Wardi, Zaid, Al-Wardi, Osama

    ISSN: 2520-0917, 2520-0925
    Veröffentlicht: Mustansiriyah University/College of Engineering 01.05.2023
    “… required to complete the computation. Then it proposes a recursive ternary-based minimization algorithm to compute the prime implicants of multi-output Boolean functions …”
    Volltext
    Journal Article
  3. 3

    Quantum algorithms for learning Walsh spectra of multi-output Boolean functions von Cui, Jingyi, Guo, Jiansheng, Xu, Linhong, Li, Mingming

    ISSN: 1570-0755, 1573-1332
    Veröffentlicht: New York Springer US 01.06.2019
    Veröffentlicht in Quantum information processing (01.06.2019)
    “… In classical cryptography, many cryptographic primitives could be treated as multi-output Boolean functions …”
    Volltext
    Journal Article
  4. 4

    On the construction of multi-output Boolean functions with optimal algebraic immunity von Zhang, Jie, Song, ShouChao, Du, Jiao, Wen, QiaoYan

    ISSN: 1674-733X, 1869-1919
    Veröffentlicht: Heidelberg SP Science China Press 01.07.2012
    Veröffentlicht in Science China. Information sciences (01.07.2012)
    “… In this paper, we show a construction of multi-output Boolean functions with optimal algebraic immunity …”
    Volltext
    Journal Article
  5. 5

    On the nonlinearity of S-boxes and linear codes von Liu, Jian, Mesnager, Sihem, Chen, Lusheng

    ISSN: 1936-2447, 1936-2455
    Veröffentlicht: New York Springer US 01.05.2017
    Veröffentlicht in Cryptography and communications (01.05.2017)
    “… For multi-output Boolean functions (also called S-boxes), various measures of nonlinearity have been widely discussed in the literature but many problems are left open in this topic …”
    Volltext
    Journal Article
  6. 6

    ON THE DEGREE OF COMPLETENESS OF CRYPTOGRAPHIC FUNCTIONS von Liu, Jian, Chen, Lusheng

    ISSN: 0217-9822, 1993-0615
    Veröffentlicht: Heidelberg Science Press 01.10.2014
    Veröffentlicht in Journal of electronics (China) (01.10.2014)
    “… This paper discusses the degree of completeness of cryptographic functions, which is one of the cryptographic criteria should be considered in the design of …”
    Volltext
    Journal Article
  7. 7

    Improved technology mapping for PAL-based devices using a new approach to multi-output boolean functions von Kania, D.

    ISBN: 0769514715, 9780769514710
    ISSN: 1530-1591
    Veröffentlicht: IEEE 2002
    “… An effective technology mapping for PAL-based devices is presented in this paper. The aim of this method is to cover a multiple-output function by a minimal …”
    Volltext
    Tagungsbericht
  8. 8

    An efficient approach to decomposition of multi-output Boolean functions with large sets of bound variables von Burns, M., Perkowski, M., Jozwiak, L.

    ISBN: 9780818686467, 0818686464
    ISSN: 1089-6503
    Veröffentlicht: IEEE 1998
    “… Finding appropriate bound sets of variables is the most important task of functional decomposition. When solving some problems, the bound sets need to be …”
    Volltext
    Tagungsbericht
  9. 9

    Fast minimization of multi-output Boolean functions in sum-of-condition-decoders structures von Mohamed, S., Perkowski, M., Jozwiak, L.

    ISBN: 0818681292, 9780818681295
    ISSN: 1089-6503
    Veröffentlicht: IEEE 1997
    “… A CDEC gate, or a condition decoder, being a product of an AND and NAND of literals, has been introduced in the logic array of the high-speed EPLD CY7C361 chip …”
    Volltext
    Tagungsbericht
  10. 10

    CCZ-equivalence of single and multi output Boolean functions von Budaghyan, Lilya, Carlet, Claude

    ISBN: 0821847864, 9780821847862
    ISSN: 0271-4132, 1098-3627
    Veröffentlicht: Providence, Rhode Island American Mathematical Society 2010
    Veröffentlicht in Finite Fields (2010)
    Volltext
    Buchkapitel
  11. 11

    Synthesis of multilevel NAND gate circuits for incompletely specified multi-output Boolean functions and CAD using permissible cubes and PCRM graphs von CHEN, LIANG-CHIA, TWU, HORNG-TAY

    ISSN: 0020-7217, 1362-3060
    Veröffentlicht: London Taylor & Francis Group 01.02.1995
    Veröffentlicht in International journal of electronics (01.02.1995)
    “… A computer-aided design procedure for the automatic design of multilevel NAND gate logic networks as encountered in the synthesis of VLSI logic circuits is …”
    Volltext
    Journal Article
  12. 12

    Improved Technology Mapping for PAL-Based Devices Using a New Approach to Multi-Output Boolean Functions von Kania, D.

    ISBN: 9780769514710, 0769514715
    Veröffentlicht: Washington, DC, USA IEEE Computer Society 04.03.2002
    Volltext
    Tagungsbericht
  13. 13

    An entropy measure for the complexity of multi-output Boolean functions von Cheng, K.-T., Agrawal, V.D.

    ISBN: 0897913639, 9780897913638
    ISSN: 0738-100X
    Veröffentlicht: IEEE 1990
    Veröffentlicht in 27th ACM/IEEE Design Automation Conference (1990)
    “… Entropy measures are examined in view of the current logic synthesis methodology. The complexity of a Boolean function can be expressed in terms of …”
    Volltext
    Tagungsbericht
  14. 14

    Spectral properties and information leakage of multi-output Boolean functions von Youssef, A.M., Tavares, S.E.

    ISBN: 0780324536, 9780780324534
    Veröffentlicht: IEEE 1995
    “… In this paper, we extend the concept of information leakage in Forre (1990) and Zhang et al. (1994) to the case of multi-output Boolean functions …”
    Volltext
    Tagungsbericht
  15. 15

    Communication based FPGA synthesis for multi-output Boolean functions von Scholl, C., Molitor, P.

    ISBN: 9784930813671, 4930813670
    Veröffentlicht: IEEE 1995
    Veröffentlicht in ASP-DAC'95-CHDL'95-VLSI'95 Proceedings (1995)
    “… One of the crucial problems multi level logic synthesis techniques for multi output Boolean functions f=(f/sub 1/,...,f/sub m/):{0,1}/sup n//spl rarr/{0,1 …”
    Volltext
    Tagungsbericht
  16. 16

    Communication based multilevel synthesis for multi-output Boolean functions von Molitor, P., Scholl, C.

    ISBN: 0818656107, 9780818656101
    Veröffentlicht: IEEE Comput. Soc. Press 1994
    “… A multilevel logic synthesis technique for multi-output Boolean functions is presented which is based on minimizing the communication complexity …”
    Volltext
    Tagungsbericht
  17. 17

    An entropy measure for the complexity of multi-output Boolean functions von Cheng, Kwang-Ting, Agrawal, Vishwani D.

    ISBN: 9780897913638, 0897913639
    Veröffentlicht: New York, NY, USA ACM 03.01.1991
    “… The complexity of a Boolean function can be expressed in terms of computational work. We present experimental data in support of the entropy definition of …”
    Volltext
    Tagungsbericht
  18. 18

    Multi‐output, multi‐level, multi‐gate design using non‐linear programming von Dimopoulos, A. C., Pavlatos, C., Papakonstantinou, G.

    ISSN: 0098-9886, 1097-007X
    Veröffentlicht: Bognor Regis Wiley Subscription Services, Inc 01.08.2022
    “… ‐output Boolean functions using any kind of two‐input gates although it can easily be extended to multi‐input gates …”
    Volltext
    Journal Article
  19. 19

    Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis von Hung, W.N.N., Xiaoyu Song, Guowu Yang, Jin Yang, Perkowski, M.

    ISSN: 0278-0070, 1937-4151
    Veröffentlicht: New York IEEE 01.09.2006
    “… This paper proposes an approach to optimally synthesize quantum circuits by symbolic reachability analysis, where the primary inputs and outputs are basis …”
    Volltext
    Journal Article
  20. 20

    High-Throughput SAT Sampling von Ardakani, Arash, Kang, Minwoo, He, Kevin, Huang, Qijing, Wawrzynek, John

    ISSN: 1558-1101
    Veröffentlicht: EDAA 31.03.2025
    “… ), our method transforms the logical constraints of SAT problems by factoring their CNF representations into simplified multilevel, multi-output Boolean functions …”
    Volltext
    Tagungsbericht