Loading...
Please wait, while we are loading the content...
Similar Documents
Goldwasser-micali Cryptosystem 1 Goldwasser-micali Cryprosystem 1.1 Quadratic Residues modulo a Prime
| Content Provider | Semantic Scholar |
|---|---|
| Author | Patra, Arpita |
| Copyright Year | 2015 |
| Abstract | It is based on the intractability of Quadratic Residuosity Assumption modulo a composite N . Very roughly, we select uniformly at random Quadratic Residues from ZN to encrypt 0 bit and to encrypt 1 bit we select quadratic non-residue from ZN . However, since the distribution of quadratic residues and quadratic non-residues are not same in ZN we confine ourselves to a subset of ZN where the number of quadratic residues is equal to the number of quadratic non-residues. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://drona.csa.iisc.ernet.in/~arpita/Cryptography15/CT7.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |