Skip to main content
Conference ProceedingsOPEN ACCESS

Cryptology and complexity theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 209 LNCS 3-9
DOI: 10.1007/3-540-39757-4_1
1Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Complexity Theories have recently been proposed as a basis for evaluation of crypto machine performance. They are compared to Shannon’s model. They shed a new highlight on randomness notion. But it is stressed that the statistical point of view remains the more secure.

Cite

CITATION STYLE

APA

Ruggiu, G. (1985). Cryptology and complexity theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 209 LNCS, pp. 3–9). Springer Verlag. https://doi.org/10.1007/3-540-39757-4_1

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