Meltem Sonmez Turan

Publications

Status Report on the First Round of the NIST Lightweight Cryptography Standardization Process

October 07, 2019

Author(s):

Meltem Sonmez Turan, Kerry A. McKay, Cagdas Calik, Dong Hoon Chang, Lawrence E. Bassham

The National Institute of Standards and Technology (NIST) is in the process of selecting one or more authenticated encryption and hashing schemes suitable for...

Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions

August 17, 2019

Author(s):

Luis Brandao, Cagdas Calik, Meltem Sonmez Turan, Rene C. Peralta

A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with...

The Multiplicative Complexity of 6-variable Boolean Functions

April 03, 2018

Author(s):

Cagdas Calik, Meltem Sonmez Turan, Rene C. Peralta

The multiplicative complexity of a Boolean function is the minimum number of AND gates that are necessary and sufficient to implement the function over the...

Recommendation for the Entropy Sources Used for Random Bit Generation

January 10, 2018

Author(s):

Meltem Sonmez Turan, Elaine B. Barker, John M. Kelsey, Kerry A. McKay, Mary L. Baish, Mike Boyle

This Recommendation specifies the design principles and requirements for the entropy sources used by Random Bit Generators, and the tests for the validation of...

Report on Lightweight Cryptography

March 28, 2017

Author(s):

Kerry A. McKay, Lawrence E. Bassham, Meltem Sonmez Turan, Nicky W. Mouha

NIST-approved cryptographic standards were designed to perform well using general-purpose computers. In recent years, there has been increased deployment of...