Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,502,001 papers from all fields of science
Search
Sign In
Create Free Account
Higher residuosity problem
In cryptography, most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem (also…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Computational hardness assumption
Cryptography
Decisional composite residuosity assumption
Integer factorization
Expand
Broader (1)
Computational number theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
Zhengtao Jiang
,
Yang Zhan
,
Dan Chen
,
Yumin Wang
Applied Mathematics and Computation
2005
Corpus ID: 38610541
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE