Higher residuosity attacks on small RSA subgroup decision problems
From MaRDI portal
Cites work
- A correction to `efficient and secure comparison for on-line auctions'
- A public-key cryptosystem utilizing cyclotomic fields
- An efficient seventh power residue symbol algorithm
- An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
- Conditional Encrypted Mapping and Comparing Encrypted Numbers
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- Efficient and Secure Comparison for On-Line Auctions
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Euclid's Algorithm in Cyclotomic Fields
- Fast computation of the biquadratic residue symbol.
- scientific article; zbMATH DE number 1617945 (Why is no real title available?)
- scientific article; zbMATH DE number 3991413 (Why is no real title available?)
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- Improved secure integer comparison via homomorphic encryption
- New number-theoretic cryptographic primitives
- Practical and Secure Solutions for Integer Comparison
- Quadratic irrationals. An introduction to classical number theory
- Short undeniable signatures based on group homomorphisms
- The eleventh power residue symbol
- The Euclidean algorithm in algebraic number fields
- Theory of Cryptography
- Threshold properties of prime power subgroups with application to secure integer comparisons
This page was built for publication: Higher residuosity attacks on small RSA subgroup decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951609)
