Cryptographic applications of combinatorial ranking for integer compositions

DOI10.1007/978-3-032-27732-9_36MaRDI QIDQ7363410zbMATH OpenFDO

Authors Gustavo Zambonin, Larissa Gremelmaier Rosa, Ricardo F. Custódio, Daniel Panario

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_36

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A calculus for the random generation of labelled combinatorial structures
• A generic approach for the unranking of labeled combinatorial classes
• A holistic approach towards side-channel secure fixed-weight polynomial sampling
• A memoir on regular combinations and their applications.
• Analytic combinatorics
• At the top of the hypercube -- better size-time tradeoffs for hash-based signatures
• Estimate of the number of restricted integer-partitions
• Format-preserving encryption
• scientific article; zbMATH DE number 3560401 (Why is no real title available?)
• scientific article; zbMATH DE number 1950338 (Why is no real title available?)
• Matters computational. Ideas, algorithms, source code.
• New algorithms and analyses for sum-preserving encryption
• Restricted compositions and permutations: from old to new Gray codes
• Restricted weighted integer compositions and extended binomial coefficients
• Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The Lean 4 theorem prover and programming language

This page was built for publication: Cryptographic applications of combinatorial ranking for integer compositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363410)