Neuenschwander D. — Probabilistic and Statistical Methods in Cryptology: An Introduction by Selected Topics :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Neuenschwander D. — Probabilistic and Statistical Methods in Cryptology: An Introduction by Selected Topics

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Probabilistic and Statistical Methods in Cryptology: An Introduction by Selected Topics

Автор: Neuenschwander D.

Аннотация:

Cryptology nowadays is one of the most important areas of applied mathematics, building on deep results and methods from various areas of mathematics. This text is devoted to the study of stochastic aspects of cryptology.

Besides classical topics from cryptology, the author presents chapters on probabilistic prime number tests, factorization with quantum computers, random-number generators, pseudo-random-number generators, information theory, and the birthday paradox and meet-in-the-middle attack.

In the light of the vast literature on stochastic results relevant for cryptology, this book is intended as an invitation and introduction for students, researchers, and practitioners to probabilistic and statistical issues in cryptology.

Язык:

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 1st edition

Год издания: 2004

Количество страниц: 158

Добавлена в каталог: 11.03.2008

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

$index_{p, g}(x)$       19
$\nu_{m}(t)$       19
$\phi$ -entropy      97
$\phi$ -uncertainty      97
AES      89
Algebraic normal form      71
Algorithmic (Turing — Kolmogorov — Chaitin) complexity      135
Approximate $\phi$ -entropy      98
Approximating fraction      40
Asymptotic equidistribution property      86
Autocorrelation      58
Autocorrelation matrix      96
Autocorrelation polynomial      95
Berlekamp — Massey algorithm      102
Birthday paradox      139
Blinding      34
Blum integer      72
Blum — Micali generator      67
Borel — Cantelli lemma      138
Bra vector      38
Brent — Kung algorithm      75
Characteristic      115
Characteristic polynomial of a LFSR      59
Chinese remainder theorem      21
Church thesis      135
Coding theorem      79
Coin-flipping protocol      34
Comparative next bit test      66
Conditional entropy      82
Confluent hypergeometric function      94
Correlation attack      69
Correlation immunity      70
Correlation polynomial      95
de Bruijn FSR      68
De Bruijn sequence      69
Differential      115
Discrete logarithm problem      18
Einstein — Podolsky — Rosen experiment      40
Electronic signature      18
ElGamal system      107
Entangled states      39
entropy      77
Error probability of first kind      81
Error probability of second kind      81
Euler's criterion      19 73
Exponential function modulo n      43
Extended Riemann hypothesis      21
Feedback shift register (FSR)      68
Fermat number      17
Fermat's little theorem      18 43
Friedman test      11
Geiger counter      47
Generating function      59
Golomb's conditions      58
Hamiltionian      39
Hamming weight      54
Hard-core predicate (bit)      67
Hash function      139
Heat equation      38
Hot Bits      47
Ideal local statistics      68
Index of coincidence      11
Indistinguishable encryption property      127
Information content      77

Irreducibility of a code (Fano condition)      78
Kasiski test      10
Ket vector      38
Kraft's inequality      78
Lagrange's theorem      109
Legendre — Jacobi symbol      19 73
Legendre-symbol      19
Linear complexity      62 101
Linear feedback shift register (LFSR)      58
Markov chain      117
Markov cipher      116
Massey — Omura system      107
Mot probable      10
Mutual information      84
Nested property of local statistics      68
Non-singular FSR      68
Nonlinear order      71
Number field sieve      37
Observable      38
One-way permutation      67
Pairing theorem      119
Parity      75
Parity algorithm      75
Pascal's ruin problem      92
Passwords in UNIX      86
Perfect secrecy      12
Perfect simulation      65
Period of a polynomial      60
PN(pseudo-noise)-sequence      58
Poisson process      49
Polarization detector      145
Polya — Aeppli distribution      94
Polynomial-time probabilistic algorithm      27
Polynomial-time random variable      125
Primality constant      24
Primality sequence      22
Prime number theorem      113
Primitive polynomial      60
Probabilistic algorithm      27
Probabilistic primality test      18
Probability amplitude      38
Public key system      17
Quadratic sieve      37
Quantum parallelism      40
Quantum teleportation      40
Qubit      39
Rabin scheme      143
Recursion polynomial      59
Regular continued fraction      40
Relative entropy (information divergence, Kullback — Leibler distance, discrimination)      80
Repeated Squaring algorithm      33
Schroedinger equation      39
Semantic security      126
Siegenthaler's inequality      71
Simmons' bound      85
Steady-state distribution      118
Stochastic equivalence assumption      117
Strong collision resistance      140
Superposition principle      38
Uniform distribution in the sense of Weyl      113
Vernam cipher      12
Walsh transform      70
Weight of a subset of $\mathcal{B}^{n}$       53
Williams algorithm      17
Xuao — Massey spectral test      70

О проекте