A simple acceptance/rejection criterium for sequence generators in symmetric cryptography

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A simple method of checking the degree of balancedness in key-stream generators of cryptographic application has been developed. The procedure is based exclusively on the handling of bit-strings by means of logic operations and can be applied to standard generators proposed and published in the open literature (combinational generators, multiple clocking generators, irregularly clocked generators). The requirements of time and memory complexity are negligible. The method here developed is believed to be a first selective criterium for acceptance/rejection of this type of generators with application in symmetric cryptography. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fúster-Sabater, A., & Caballero-Gil, P. (2005). A simple acceptance/rejection criterium for sequence generators in symmetric cryptography. In Lecture Notes in Computer Science (Vol. 3482, pp. 719–728). Springer Verlag. https://doi.org/10.1007/11424857_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free