A RECURSIVE CONSTRUCTION METHOD OF S-BOXES SATISFYING STRICT AVALANCHE CRITERION

S(ubstitution)-boxes are quite important components of modern symmetric cryptosystems. S-boxes bring nonlinearity to cryptosystems and strengthen their cryptographic security. An S-box satisfies the strict avalanche criterion (SAC), if and only if for any single input bit of the S-box, the inversion of it changes each output bit with probability one half. We present some interesting properties of S-boxes and propose an efficient and systematic means of generating arbitrary input size bijective S-boxes satisfying the SAC by applying simple rules recursively given 3-bit input bijective S-box(es) satisfying the SAC.
Publisher
SPRINGER VERLAG
Issue Date
1991-01
Language
ENG
Citation

LECTURE NOTES IN COMPUTER SCIENCE, v.537, pp.564 - 574

ISSN
0302-9743
URI
http://hdl.handle.net/10203/65387
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 149
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0