Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength

Juan David González Cobas Contact Information and José Antonio López Brugos Contact Information

Abstract
Quality assessment for cryptographic algorithms is usually devised by a combination of statistical or information-theoretic techniques for testing a pseudo-random sequence generator (PRSG for short). Many tests among these share a common framework. The difference among tests usually relies on the choice of the computational device and its suitable definition of “size” that determines the workload needed to match the allegedly random output of a PRSG.
The most outstanding examples among these are compared, showing that there appears to be a hierarchy of tests whose complexity increases with their discriminating power.
The possibility of a tradeoff between computational complexity of the measure and its value in cryptographic strength assessment is explored, and the criteria towards an optimal measure of strength are proposed.

Contact Information Juan David González Cobas
Email: cobas@etsiig.uniovi.es

Contact Information José Antonio López Brugos
Email: brugos@etsiig.uniovi.es
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.108 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)