Random Mapping Statistics

The Art of Computer Programming: Volume 3: Sorting and Searching

Knuth, D. E. (1973) · Cited by 3,955

The Art of Computer Programming. Volume 2: Seminumerical Algorithms.

Taussky, O., & Knuth, D. E. (1970) · American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,863

Asymptotics and Special Functions

Olver, F. W. J. (1997) · A K Peters/CRC Press eBooks · doi:10.1201/9781439864548 · Cited by 3,368

The theory of functions

Titchmarsh, E. C. (1932) · BURJC Digital (King Juan Carlos University) · Cited by 2,290

Enumerative Combinatorics

Stanley, R. P. (1986) · Springer eBooks · doi:10.1007/978-1-4615-9763-6 · Cited by 1,796

Asymptotic methods in analysis

de Bruijn, N. G. (1958) · International Linear Collider · Cited by 1,332

Combinatorial Enumeration

Pemantle, R., Wilson, M. C., & Melczer, S. (2024) · Cambridge University Press eBooks · doi:10.1017/9781108874144.003 · Cited by 939

Singularity Analysis of Generating Functions

Flajolet, P., & Odlyzko, A. M. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403019 · Cited by 786

The Art of Computer Programming, Volume 3, Sorting and Searching

Wilkes, M. (1974) · The Computer Journal · doi:10.1093/comjnl/17.4.324 · Cited by 731

A monte carlo method for factorization

Pollard, J. M. (1975) · BIT Numerical Mathematics · doi:10.1007/bf01933667 · Cited by 403

Runs in labelled trees and mappings

Lackner, M.-L., & Panholzer, A. (2020) · Discrete Mathematics · doi:10.1016/j.disc.2020.111990 · Cited by 2

Practical Consequences of the Aberration of Narrow-Pipe Hash Designs from Ideal Random Functions

Gligoroski, D., & Klíma, V. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-19325-5_9 · Cited by 2

The Square Discrete Exponentiation Map

Wood, A. (2011) · Rose-Hulman Scholar (Rose–Hulman Institute of Technology) · Cited by 2

Alternating mapping functions

Panholzer, A. (2013) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2013.07.005 · Cited by 2

A probabilistic approach to value sets of polynomials over finite fields

Gao, Z., & Wang, Q. (2015) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2014.12.003 · Cited by 2

Enhanced Ant Colony-Inspired Parallel Algorithm to Improve Cryptographic PRNGs

Keller, J., FernUniversit�at in Hagen, G., Spenger, G., FernUniversit�at in Hagen, G., & Wendzel, S. (2017) · Journal of Cyber Security and Mobility · doi:10.13052/jcsm2245-1439.623 · Cited by 2

Short Synchronizing Words for Random Automata

Chapuy, G., & Perarnau, G. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch26 · Cited by 2

Replication study challenges and new number formats for chaotic pseudo random number generators

Heßeling, C., & Keller, J. (2022) · it - Information Technology · doi:10.1515/itit-2021-0065 · Cited by 2

Modes of Operation of a Block Cipher

Bart Preneel, A. (2006) · Springer eBooks · doi:10.1007/0-387-23483-7_258 · Cited by 2

A distributed query structure to explore random mappings in parallel

Heichler, J., & Keller, J. (2006) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp.2006.10 · Cited by 2

On the Cryptanalysis of Public-Key Cryptography

Bos, J. W. (2011) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-5291 · Cited by 2

Distinguishing and Key-recovery Attacks against WheeshtPreprint

Canteaut, A., & Leurent, G. (2014) · HAL · Cited by 2

Enumerative properties of restricted words and compositions

MacFie, A. (2019) · doi:10.22215/etd/2019-13532 · Cited by 2

Exploring the Discrete Logarithm with Random Ternary Graphs

Brugger, M. (2008) · Cited by 2

Dynamical systems of non-algebraic origin: Fixed points and orbit lengths

Shparlinski, I. E. (2016) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/669/13432 · Cited by 2

Dividing sum of cycles in the semiring of functional digraphs

Bridoux, F., Crespelle, C., Phan, T. H. D., & Richard, A. (2026) · Natural Computing · doi:10.1007/s11047-026-10065-w · Cited by 1

On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States

Felice, S. D., & Nicaud, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09698-8_3 · Cited by 1

CRYPTOGRAPHY AND CRYPTANALYSIS ON RECONFIGURABLE DEVICES Security Implementations for Hardware and Reprogrammable Devices

Tim Erhan, G. (2009) · Cited by 1

Security aspects of PRNGs with large state spaces

Spenger, G., & Keller, J. (2015) · International Conference for Internet Technology and Secured Transactions · doi:10.1109/icitst.2015.7412084 · Cited by 1

for the Random Generation of Combinatorial Structures

Samplers, B., Uchon, P. D., Lajolet, P. F., Ouchard, G. L., & Illes, G. (2004) · Cited by 1

Analysis and Improvements of a Light-weight Authentication Scheme for Wireless Sensor Networks

Hu, L. Q., Chi, L., Li, H., Yuan, W., Sun, Y., & -, J. C. (2012) · Journal of Convergence Information Technology · doi:10.4156/jcit.vol7.issue13.8 · Cited by 1

Periods of Iterations of Functions with Restricted Preimage Sizes

Martins, R. S. V., Panario, D., Qureshi, C., & Schmutz, E. J. (2020) · ACM Transactions on Algorithms · doi:10.1145/3378570 · Cited by 1

Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics

Prodinger, H., & Szpankowski, W. (1998) · Algorithmica · doi:10.1007/pl00009230 · Cited by 1

Mod- φ convergence: Approximation of discrete measures and harmonic analysis on the torus

Chhaibi, R., Delbaen, F., Méliot, P., & Nikeghbali, A. (2020) · Annales de l’institut Fourier · doi:10.5802/aif.3332 · Cited by 1

Periodic points and tail lengths of split polynomial maps modulo primes

Hutz, B., & Patel, T. (2022) · Involve a Journal of Mathematics · doi:10.2140/involve.2022.15.185 · Cited by 1

Распределение длины отрезка апериодичности в графе композиции независимых равновероятных случайных отображений

Олегович, М. В. (2019) · Математические вопросы криптографии · doi:10.4213/mvk302 · Cited by 1

Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?

Ndiaye, N., Norin, S., & Vetta, A. R. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-85947-3_19 · Cited by 1

Improving Generic Attacks Using Exceptional Functions

Bonnetain, X., Boissier, R. H., Leurent, G., & Schrottenloher, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68385-5_4 · Cited by 2

Implementation and Evaluation of a Parallel-External Algorithm for Cycle Structure Computation on a PC-Cluster.

Boursas, L., & Keller, J. (2004) · Cited by 1

Highly parallel cryptographic attacks

Peinado, M., & Venkatesan, R. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63697-8_106 · Cited by 1

Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques

Thomé, E. (2012) · HAL · Cited by 1

Hidden Structures and Quantum Cryptanalysis

Bonnetain, X. (2019) · theses.fr (ABES) · doi:10.70675/376c5157z8acez485dzab89z9e1bfa697ee9 · Cited by 1

The Structure of an Evolving Random Bipartite Graph

Kutzelnigg, R. (2012) · Wiley eBooks · doi:10.1002/9781118346990.ch7

The Statistics of Simulating Chaos

Diamond, P., & Pokrovskii, A. V. (2001) · Statistics and Computing · doi:10.1023/a:1016648220222

Graph structure of commuting functionsPreprint

Daugulis, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.6035

A new random mapping modelPreprint

Hansen, J. C., & Jaworski, J. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0603529

On the periodic properties of self-decimated generators of pseudorandom numbersPreprint

Agievich, S., & Solovey, O. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0505660

CONSOLIDATING A HEURISTIC FOR INCREMENTAL DECISION TREE LEARNING THROUGH ASYMPTOTIC ANALYSIS

Kalles, D., Papagelis, A., & Stamatiou, Y. C. (2011) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213011000024

Cycles in random k-ary maps and the poor performance of random number generation

Pemantle, R. (2003) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.09.002

The Probabilistic Structure of Discrete Agent-Based Models

Banisch, S. (2014) · The interdisciplinary journal of Discontinuity Nonlinearity and Complexity · doi:10.5890/dnc.2014.09.005

Efficient computation of the iteration of functions

Tsai, T. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.12.019

Error detection in number-theoretic and algebraic algorithms

Vasiga, T. (2008) · UWSpace (University of Waterloo)

Ascending Runs in Cayley Trees and MappingsPreprint

Bruner, M.-L., & Panholzer, A. (2015) · arXiv (Cornell University)

Analysis of PRNGs with Large State Spaces and Structural Improvements

Spenger, G., & Keller, J. (2014) · International Journal of RFID Security and Cryptography · doi:10.20533/ijrfidsc.2046.3715.2014.0019

The Art of Iterating Rational Functions over Finite Fields

Boston, N., & Zieve, M. E. (2013)

Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash ChainsPreprint

Schoenmakers, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.03748

Approximations of Mappings

Nešetřil, J., & de Mendez, P. O. (2019) · Bolyai Society mathematical studies · doi:10.1007/978-3-662-59204-5_11

Coalescence under Preimage ConstraintsPreprint

Otto, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00542

Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES 2 .

Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2013)

Blockcipher Based Hashing Revisited.

Stam, M. (2008)

Expected Maximum Block Size in Critical Random Graphs

Rasendrahasina, V., Rasoanaivo, A., & Ravelomanana, V. (2019) · Combinatorics Probability Computing · doi:10.1017/s0963548319000154

Improving the Cycle Lengths of Chaotic PRNGs

Spenger, G., & Keller, J. (2016) · International Journal of Chaotic Computing · doi:10.20533/ijcc.2046.3359.2016.0008

Maximizing the Expected Value of a Lottery Ticket: How to Sell and When to Buy

Kim, A., & Skiena, S. (2020) · CHANCE · doi:10.1080/09332480.2020.1726116

Collision Spectrum, Entropy Loss, T-Sponges, and Cryptanalysis of GLUON-64.

Perrin, L. P., & Khovratovich, D. (2014)

Слои в графе композиции независимых равновероятных случайных отображений

Олегович, М. В. (2020) · Математические вопросы криптографии · doi:10.4213/mvk316

Iteration entropy

Gathen, J. V. Z. (2018) · Mathematics of Computation · doi:10.1090/mcom/3382

ON IMAGES AND PRE-IMAGES IN A GRAPH OF THE COMPOSITION OF INDEPENDENT UNIFORM RANDOM MAPPINGS

Олегович, М. В. (2020) · PRIKLADNAYa DISKRETNAYa MATEMATIKA · doi:10.17223/20710410/49/1

Permute, Graph, Map, DerangePreprint

Finch, S. R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05720

Rounds, Color, Parity, SquaresPreprint

Finch, S. R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.14487

The component counts of random functions

Stark, D. (2022) · Discrete Mathematics · doi:10.1016/j.disc.2022.112977

Attacking the IETF/ISO Standard for Internal Re-keying CTR-ACPKM

Dunkelman, O., Ghosh, S., & Lambooij, E. (2023) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2023.i1.41-66

On the deepest cycle of a random mapping

Mutafchiev, L. R., & Finch, S. R. (2024) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2024.105875

Random maps with sociological flavor

Krapivsky, P. L. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad4321

A Birthday Attack on the Birthday Problem

Harrison, M., & Morrison, T. (2025) · Mathematics Magazine · doi:10.1080/0025570x.2025.2509470

A New Efficient Cryptographic Permutation Scheme

Zheng, E., & Zheng, J. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-92611-2_19

Randomization of message contents with and without encryption for covert communication scenarios

Rajba, P., Keller, J., & Mazurczyk, W. (2025) · International Journal of Information Security · doi:10.1007/s10207-025-01160-7

Revisiting Time-Space Tradeoffs in Collision Search and Decision Problems

Guo, J., Nan, W., & Yao, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5018-0_17

Cryptanalyse des algorithmes de type Even-Mansour

Mavromati, C. (2017) · doi:10.70675/18184677z2348z452cz94b7z9c607af5f3b6

Quantum algorithms for the Monte Carlo method

Hamoudi, Y. (2021) · theses.fr (ABES) · doi:10.70675/43dbb94ez355ez42d2za9e8z47c1e9983ab9

Security of Modes of Operation and other provably secure cryptographic schemes

Sibleyras, F. (2020) · doi:10.70675/2fc3457cz9d69z4578z8c93z95fb4ddebc9b

Isomorphisme de réseaux d'automates et son influence sur le graphe d'interaction

Marchetto, A. P. (2024) · theses.fr (ABES) · doi:10.70675/4d3c3503zd173z4d93zbf40z14f7cada2f32

Symmetric cryptanalysis ˸ from primitives to modes

Boissier, R. H. (2024) · theses.fr (ABES) · doi:10.70675/107ee980z2beez434aza1dbz37f6474d6e9f

DES Collisions Revisited

Indesteege, S., & Bart Preneel, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28368-0_4

Runtime Intellectual Property Protection on Programmable Platforms

Simpson, E. (2007)

Weighted random mappings; properties and applications (integer factorization, pollard's rmo method)

Broder, A. (1985) · Cited by 1

On a simple formula for random mappings and its applications

Burtin, Y. D. (1980) · Journal of Applied Probability · doi:10.1017/s0021900200047227 · Cited by 45

The asymptotic distribution of the diameter of a random mapping

Aldous, D., & Pitman, J. (2002) · Comptes Rendus Mathématique · doi:10.1016/s1631-073x(02)02386-5 · Cited by 8

Characterization of random mappings

Kalugin, I. B. (1986) · Mathematical Notes · doi:10.1007/bf01170253 · Cited by 1

Probabilistic methods in discrete mathematics : proceedings of the Third International Petrozavodsk Conference

Kolchin, V. F. (1993) · VSP eBooks