DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kwangjo | ko |
dc.contributor.author | Matsumoto, Tsutomu | ko |
dc.contributor.author | Imai, Hideki | ko |
dc.date.accessioned | 2013-02-25T21:22:32Z | - |
dc.date.available | 2013-02-25T21:22:32Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1991-01 | - |
dc.identifier.citation | LECTURE NOTES IN COMPUTER SCIENCE, v.537, pp.564 - 574 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/65387 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | SPRINGER VERLAG | - |
dc.title | A RECURSIVE CONSTRUCTION METHOD OF S-BOXES SATISFYING STRICT AVALANCHE CRITERION | - |
dc.type | Article | - |
dc.identifier.wosid | A1991KQ92800039 | - |
dc.type.rims | ART | - |
dc.citation.volume | 537 | - |
dc.citation.beginningpage | 564 | - |
dc.citation.endingpage | 574 | - |
dc.citation.publicationname | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.contributor.localauthor | Kim, Kwangjo | - |
dc.contributor.nonIdAuthor | Matsumoto, Tsutomu | - |
dc.contributor.nonIdAuthor | Imai, Hideki | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.