An informal enumeration of squares of 2ᵏ using rooted trees arising from congruences
From MaRDI portal
Publication:4604343
Recommendations
- The distribution of quadratic residues and non-residues in the Goldwasser-Micali type of cryptosystem
- Little extension of Euler's criterion for quadratic residue
- Cryptoanalysis of cryptosystems based on the quadratic residue problem
- On the distribution of quadratic residues and non-residues modulo composite integers and applications to cryptography
- On the quadratic reciprocity law
Cited in
(5)- A new approach for the enumeration of components of digraphs over quadratic maps
- Structures of power digraphs over the congruence equation \(x^p\equiv y\; (\text{mod}\; m)\) and enumerations
- The distribution of quadratic residues and non-residues in the Goldwasser-Micali type of cryptosystem
- A novel approach to find partitions of \(Z_m\) with equal sum subsets via complete graphs
- scientific article; zbMATH DE number 2165783 (Why is no real title available?)
This page was built for publication: An informal enumeration of squares of \(2^k\) using rooted trees arising from congruences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604343)