Institutional Login
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
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2178/2001
Book
Computer Aided Systems Theory — EUROCAST 2001
DOI
10.1007/3-540-45654-6
Copyright
2001
ISBN
978-3-540-42959-3
DOI
10.1007/3-540-45654-6_19
Pages
3-14
Subject Collection
Computer Science
SpringerLink Date
Monday, January 01, 2001
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (163.3 KB)
Free Preview
A Complexity-Theoretic Approach to the Design of Good Measures of Cryptographic Strength
Juan David González Cobas
and José Antonio López Brugos
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.
Juan
David
González Cobas
Email:
cobas@etsiig.uniovi.es
José
Antonio
López
Brugos
Email:
brugos@etsiig.uniovi.es
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.108 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)