Probabilistic and statistical methods in cryptology. An introduction by selected topics.

DOI10.1007/b97045zbMath1088.94001OpenAlexW2501555425MaRDI QIDQ1889969

Daniel Neuenschwander

Publication date: 13 December 2004

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97045

zbMATH Keywords

RSAdifferential cryptanalysissubstitution cipherrandom-number generatorrandomness testspseudo random-numberquantum factorization

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Random number generation in numerical analysis (65C10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users, Testing Stream Ciphers by Finding the Longest Substring of a Given Density