Hamming Weight Attacks on Cryptographic Hardware — Breaking Masking Defense

Computer Security — ESORICS 2002 - Lecture Notes in Computer Science ◽

10.1007/3-540-45853-0_6 ◽

2002 ◽

pp. 90-103 ◽

Cited By ~ 1

Author(s):

Marcin Gomuffłkiewicz ◽

Mirosffław Kutyffłowski

Keyword(s):

Hamming Weight ◽

Cryptographic Hardware

Evaluation of Information Leakage from Cryptographic Hardware via Common-Mode Current

IEICE Transactions on Electronics ◽

10.1587/transele.e95.c.1089 ◽

2012 ◽

Vol E95.C (6) ◽

pp. 1089-1097 ◽

Cited By ~ 5

Author(s):

Yu-ichi HAYASHI ◽

Naofumi HOMMA ◽

Takaaki MIZUKI ◽

Takeshi SUGAWARA ◽

Yoshiki KAYANO ◽

...

Keyword(s):

Information Leakage ◽

Common Mode ◽

Cryptographic Hardware

Hamming weight distributions of multi-twisted codes over finite fields

Designs Codes and Cryptography ◽

10.1007/s10623-021-00889-1 ◽

2021 ◽

Author(s):

Varsha Chauhan ◽

Anuradha Sharma ◽

Sandeep Sharma ◽

Monika Yadav

Keyword(s):

Finite Fields ◽

Hamming Weight ◽

Weight Distributions

Asynchronous Cryptographic Hardware Design

Proceedings 40th Annual 2006 International Carnahan Conference on Security Technology ◽

10.1109/ccst.2006.313454 ◽

2006 ◽

Cited By ~ 4

Author(s):

John Teifel

Keyword(s):

Hardware Design ◽

Cryptographic Hardware

Secure Management of Biomedical Data With Cryptographic Hardware

IEEE Transactions on Information Technology in Biomedicine ◽

10.1109/titb.2011.2171701 ◽

2012 ◽

Vol 16 (1) ◽

pp. 166-175 ◽

Cited By ~ 37

Author(s):

M. Canim ◽

M. Kantarcioglu ◽

B. Malin

Keyword(s):

Biomedical Data ◽

Cryptographic Hardware

Relationship between Hamming weight and peak-to-mean envelope power ratio of orthogonal frequency division multiplexing

Proceedings IEEE International Symposium on Information Theory, ◽

10.1109/isit.2002.1023517 ◽

2003 ◽

Cited By ~ 1

Author(s):

C. Tellambura ◽

M.G. Parker

Keyword(s):

Orthogonal Frequency Division Multiplexing ◽

Frequency Division Multiplexing ◽

Hamming Weight ◽

Power Ratio ◽

Frequency Division

The relative generalized Hamming weight and the semilinear equivalence of codes

Science China Information Sciences ◽

10.1007/s11432-010-4143-1 ◽

2010 ◽

Vol 54 (4) ◽

pp. 787-794 ◽

Cited By ~ 1

Author(s):

ZiHui Liu ◽

Jie Wang

Keyword(s):

Hamming Weight ◽

Generalized Hamming Weight ◽

Relative Generalized Hamming Weight

Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents

Finite Fields and Their Applications ◽

10.1016/j.ffa.2021.101910 ◽

2021 ◽

Vol 76 ◽

pp. 101910

Author(s):

Varsha Chauhan ◽

Anuradha Sharma

Keyword(s):

Hamming Weight ◽

Weight Enumerators

Solving the DLP with Low Hamming Weight Product Exponents and Improved Attacks on the GPS Identification Scheme

Information Security and Privacy - Lecture Notes in Computer Science ◽

10.1007/978-3-319-59870-3_31 ◽

2017 ◽

pp. 460-467

Author(s):

Jason H. M. Ying ◽

Noboru Kunihiro

Keyword(s):

Hamming Weight ◽

Identification Scheme

Guest editors' introduction to the special section on cryptographic hardware and embedded systems

IEEE Transactions on Computers ◽

10.1109/tc.2003.1190580 ◽

2003 ◽

Vol 52 (4) ◽

pp. 401-402 ◽

Cited By ~ 1

Author(s):

C.K. Koc ◽

C. Paar

Keyword(s):

Embedded Systems ◽

Special Section ◽

Cryptographic Hardware

Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography

Evolutionary Computation ◽

10.1162/evco_a_00190 ◽

2016 ◽

Vol 24 (4) ◽

pp. 667-694 ◽

Cited By ~ 13

Author(s):

Stjepan Picek ◽

Claude Carlet ◽

Sylvain Guilley ◽

Julian F. Miller ◽

Domagoj Jakobovic

Keyword(s):

Evolutionary Algorithms ◽

Genetic Programming ◽

Evolutionary Computation ◽

Boolean Functions ◽

Coding Theory ◽

Design Criteria ◽

Hamming Weight ◽

High Quality ◽

Distinct Role

The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.