Cryptology and complexity theories

1Citations
Citations of this article
35Readers
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.

References Powered by Scopus

New Directions in Cryptography

10614Citations
N/AReaders
Get full text

Communication Theory of Secrecy Systems

7198Citations
N/AReaders
Get full text

On the Complexity of Finite Sequences

2248Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Weak keys and weak data foiling the two nemeses

0Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 19

61%

Professor / Associate Prof. 5

16%

Researcher 4

13%

Lecturer / Post doc 3

10%

Readers' Discipline

Tooltip

Computer Science 22

71%

Mathematics 4

13%

Engineering 3

10%

Physics and Astronomy 2

6%

Save time finding and organizing research with Mendeley

Sign up for free