Earticle

현재 위치 Home

Distributed Computation of SBoxes with Strong Security Properties

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJSIA) 바로가기
  • 간행물
    International Journal of Security and Its Applications SCOPUS 바로가기
  • 통권
    Vol.6 No.2 (2012.04)바로가기
  • 페이지
    pp.29-46
  • 저자
    Panayotis E. Nastou, Yannis C. Stamatiou
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A210854

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
Substitution boxes are among the most critical components of a secure block cipher de- sign. A substitution box or, for short, SBox, is a set of Boolean functions implementing a nonlinear mapping of inputs to outputs and it is employed for mixing the input of the cipher with the encryption key so that the output of the cipher reveals no information about the encryption key. Over the years, a number of good practices have evolved that, if employed, can lead to the construction of SBoxes with good security properties that lead to the cipher’s resistance against known and envisaged cryptanalysis techniques. One such practice is the employment of particular classes of Boolean functions that possess a number of desirable properties. A drawback of such an approach is that it is frequently a computationally demanding task to check that the employed Boolean functions and the resulting SBox have the target properties. In this paper we describe a distributed algorithm that can accelerate significantly the construction of SBoxes with desirable cryptographic properties. The algorithm has been implemented on a computer cluster and it is fully parametric, with respect to the type of Boolean functions it can use as constituents of the SBox. A designer can use a class of Boolean functions with algorithmically definable properties in order to produce SBoxes of arbitrary sizes. We also present evidence for the algorithm’s efficiency by comparing it with the best sequential approach available in a series of different experimental setups.

목차

Abstract
 1 Introduction
 2 Background
  2.1 Nonlinearity of a Boolean function
  2.2 Strict avalanche criterion
  2.3 Propagation criteria and correlation immunity
  2.4 Bent functions
 3 Distributed SBox computation
 4 Implementing the distributed algorithm on a computing cluster
 5 Experimental results
 6 Conclusions
 References

키워드

Symmetric Block Ciphers Distributed SBox Computation Nonlinearity SAC criterion Bent Functions Almost Perfect Nonlinear functions Computing Cluster.

저자

  • Panayotis E. Nastou [ Dept of Mathematics University of Aegean Samos, Greece ]
  • Yannis C. Stamatiou [ Dept of Business Administration University of Patras Patras, Greece ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJSIA) [Science & Engineering Research Support Center, Republic of Korea(IJSIA)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Security and Its Applications
  • 간기
    격월간
  • pISSN
    1738-9976
  • 수록기간
    2008~2016
  • 등재여부
    SCOPUS
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Security and Its Applications Vol.6 No.2

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장