IEICE TRANSACTIONS on Fundamentals
Generalization of Higher Order SAC to Vector Output Boolean Functions
Summary :
S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC (k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC (k) to vector output Boolean functions as the first step toward the security of block ciphers against attacks which keep some input bits constant. We first show a close relationship between such Boolean functions and linear error correcting codes. Then we show the existence, bounds and enumeration of vector Boolean functions which satisfy the generalized SAC (k). A design method and examples are also presented.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.1 pp.41-47
- Publication Date
- 1998/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kaoru KUROSAWA, Takashi SATOH, "Generalization of Higher Order SAC to Vector Output Boolean Functions" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 1, pp. 41-47, January 1998, doi: .
Abstract: S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC (k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC (k) to vector output Boolean functions as the first step toward the security of block ciphers against attacks which keep some input bits constant. We first show a close relationship between such Boolean functions and linear error correcting codes. Then we show the existence, bounds and enumeration of vector Boolean functions which satisfy the generalized SAC (k). A design method and examples are also presented.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_1_41/_p
Copy
@ARTICLE{e81-a_1_41,
author={Kaoru KUROSAWA, Takashi SATOH, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generalization of Higher Order SAC to Vector Output Boolean Functions},
year={1998},
volume={E81-A},
number={1},
pages={41-47},
abstract={S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC (k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC (k) to vector output Boolean functions as the first step toward the security of block ciphers against attacks which keep some input bits constant. We first show a close relationship between such Boolean functions and linear error correcting codes. Then we show the existence, bounds and enumeration of vector Boolean functions which satisfy the generalized SAC (k). A design method and examples are also presented.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Generalization of Higher Order SAC to Vector Output Boolean Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 41
EP - 47
AU - Kaoru KUROSAWA
AU - Takashi SATOH
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1998
AB - S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC (k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC (k) to vector output Boolean functions as the first step toward the security of block ciphers against attacks which keep some input bits constant. We first show a close relationship between such Boolean functions and linear error correcting codes. Then we show the existence, bounds and enumeration of vector Boolean functions which satisfy the generalized SAC (k). A design method and examples are also presented.
ER -
English
