An informal enumeration of squares of 2ᵏ using rooted trees arising from congruences

zbMATH Open1386.05089MaRDI QIDQ4604343FDOQ4604343

Authors: Farooq Ahmad, M. Khalid Mahmood 

Publication date: 23 February 2018

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

zbMATH Keywords

quadratic residuesrooted treesleaf nodes

Mathematics Subject Classification ID

Trees (05C05) Cryptography (94A60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Quadratic forms over general fields (11E04) Linear algebraic groups over arbitrary fields (20G15)

Cited In (5)

• A new approach for the enumeration of components of digraphs over quadratic maps
• The distribution of quadratic residues and non-residues in the Goldwasser-Micali type of cryptosystem
• Structures of power digraphs over the congruence equation \(x^p\equiv y\; (\text{mod}\; m)\) and enumerations
• A novel approach to find partitions of \(Z_m\) with equal sum subsets via complete graphs
• Title not available (Why is that?)

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)