Design and implementation of a novel cryptographically secure pseudorandom number generator
Article in Journal of Cryptographic Engineering (August 2022)
Exploring RANDOMNESS
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Historical introduction — A century of controversy over the foundations of mathematics
-
Altmetric BadgeChapter 2 What is LISP? Why do I like it?
-
Altmetric BadgeChapter 3 How to program my universal Turing machine in LISP
-
Altmetric BadgeChapter 4 A self-delimiting Turing machine considered as a set of (program, output) pairs
-
Altmetric BadgeChapter 5 How to construct self-delimiting Turing machines: the Kraft inequality
-
Altmetric BadgeChapter 6 The connection between program-size complexity and algorithmic probability: H(x) =-log 2 P(x) + O (1). Occam’s razor: there are few minimum-size programs
-
Altmetric BadgeChapter 7 The basic result on relative complexity: H(y∣x)=H(x,y)-H(x)+O(1)
-
Altmetric BadgeChapter 8 Theoretical interlude—What is randomness? My definitions
-
Altmetric BadgeChapter 9 Proof that Martin-Löf randomness is equivalent to Chaitin randomness
-
Altmetric BadgeChapter 10 Proof that Solovay randomness is equivalent to Martin-Löf randomness
-
Altmetric BadgeChapter 11 Proof that Solovay randomness is equivalent to strong Chaitin randomness
-
Altmetric BadgeChapter 12 Extending AIT to the size of programs for computing infinite sets and to computations with oracles
-
Altmetric BadgeChapter 13 Postscript—Letter to a daring young reader
Altmetric Badge
Citations
- dimensions_citation
- 62 Dimensions