Template:Computational hardness assumptions - Revision history

Indicwiki: 1 revision imported from :alpha:Template:Computational_hardness_assumptions

2023-05-17T04:26:33Z

1 revision imported from alpha:Template:Computational_hardness_assumptions

← Older revision	Revision as of 09:56, 17 May 2023
(No difference)

alpha>Indicwiki at 07:35, 22 February 2023

2023-02-22T07:35:11Z

← Older revision		Revision as of 13:05, 22 February 2023
Line 1:		Line 1:
	{{Navbox		{{Navbox
	\| name = ~~Computational hardness assumptions~~		\| name =कम्प्यूटेशनल कठोरता धारणाएँ
	\| title = [[~~Computational hardness assumption~~\|~~Computational hardness assumptions~~]]		\| title =[[कम्प्यूटेशनल कठोरता धारणा \| कम्प्यूटेशनल कठोरता धारणाएं]]
	\| bodyclass = hlist		\| bodyclass = hlist

	\| group1 = ~~Number theoretic~~
	\| list1 =		\| group1 =संख्या सिद्धांत
	* [[~~Integer factorization~~]]		\| list1 =* [[पूर्णांक कारक]]
	* [[~~Phi~~-~~hiding assumption~~\|~~Phi~~-~~hiding~~]]		* [[फी-छिपाने की धारणा \| फी-छिपा]]
	* [[~~RSA problem~~]]		* [[आरएसए समस्या]]
	* [[~~Strong RSA assumption~~\|~~Strong RSA~~]]		* [[मजबूत आरएसए धारणा \| मजबूत आरएसए]]
	* [[~~Quadratic residuosity problem~~\|~~Quadratic residuosity~~]]		* [[द्विघात अवशेषों की समस्या \| द्विघात अवशेष]]
	* [[~~Decisional composite residuosity assumption~~\|~~Decisional composite residuosity~~]]		* [[निर्णायक समग्र अवशेषों की धारणा \| निर्णायक समग्र अवशेष]]
	* [[~~Higher residuosity problem~~\|~~Higher residuosity~~]]		* [[उच्च अवशेषों की समस्या \| उच्च अवशेष]]
			\| group2 =समूह सिद्धांत
	\| group2 = ~~Group theoretic~~		\| list2 =* [[असतत_लोगरिथम # क्रिप्टोग्राफी \| असतत लॉगरिथम]]
	\| list2 =		* [[डिफी-हेलमैन समस्या \| डिफी-हेलमैन]]
	* [[~~Discrete_logarithm~~#~~Cryptography~~\|~~Discrete logarithm~~]]		* [[निर्णायक डिफी -हेलमैन धारणा \| निर्णायक डिफी -हेलमैन]]
	* [[~~Diffie–Hellman problem~~\|~~Diffie~~-~~Hellman~~]]		* [[कम्प्यूटेशनल डिफी -हेलमैन धारणा \| कम्प्यूटेशनल डिफी -हेलमैन]]
	* [[~~Decisional Diffie–Hellman assumption~~\|~~Decisional Diffie–Hellman~~]]		\| group3 =जोड़ियां
	* [[~~Computational Diffie–Hellman assumption~~\|~~Computational Diffie–Hellman~~]]		\| list3 =* [[XDH धारणा \| बाहरी diffie -hellman]]
			* [[उप-समूह छिपा हुआ]]
	\| group3 = ~~Pairings~~		* [[निर्णय रैखिक धारणा \| निर्णय रैखिक]]
	\| list3 =		\| group4 =जाली
	* [[XDH ~~assumption~~\|~~External Diffie–Hellman~~]]		\| list4 =* [[Lattice_problem # सबसे छोटा_vector_problem_ (svp) \| सबसे छोटा वेक्टर समस्या]]
	* [[~~Sub~~-~~group hiding~~]]		* [[Lattice_problem # CLOSEST_VECTOR_PROBLEM_ (CVP) \| निकटतम वेक्टर समस्या]] ([[lattice_problem # gapcvp \| GAP]]
	* [[~~Decision Linear assumption~~\|~~Decision linear~~]]		* [[त्रुटियों के साथ सीखना]]
			* [[त्रुटियों के साथ रिंग सीखना]]
	\| group4 = ~~Lattices~~		* [[लघु पूर्णांक समाधान समस्या \| लघु पूर्णांक समाधान]]
	\| list4 =		\| group5 =गैर-क्रिप्टोग्राफ़िक
	* [[Lattice_problem#~~Shortest_vector_problem_~~(~~SVP~~)\|~~Shortest vector problem]] ([[Lattice_problem#GapSVP\|gap~~]])		\| list5 =* [[घातीय समय परिकल्पना]]
	* [[Lattice_problem#~~Closest_vector_problem_~~(CVP)\|~~Closest vector problem~~]] ([[~~Lattice_problem~~#~~GapCVP~~\|~~gap~~]])		* [[अद्वितीय खेल अनुमान]]
	* [[~~Learning with errors~~]]		* [[लगाए गए क्लिक \| लगाए गए क्लिक कॉनजेक्चर]]
	* [[~~Ring learning with errors~~]]		}}
	* [[~~Short integer solution problem~~\|~~Short integer solution~~]]		<noinclude>

	\| group5 = ~~Non~~-~~cryptographic~~
	\| list5 =
	* [[~~Exponential time hypothesis~~]]
	* [[~~Unique games conjecture~~]]
	* [[~~Planted clique~~\|~~Planted clique conjecture~~]]
	}}<noinclude>
	{{documentation \| content =		{{documentation \| content =
	{{collapsible option}}		{{collapsible option}}
	}}		}}
	[[Category:Computer science navigational boxes]]		[[Category:Computer science navigational boxes]]
	</noinclude>
			</noinclude>[[Category: Templates Vigyan Ready]][[Category:Templates Translated in Hindi]]

Indicwiki: 1 revision imported from :alpha:Template:Computational_hardness_assumptions

2022-12-26T08:16:25Z

1 revision imported from alpha:Template:Computational_hardness_assumptions

← Older revision	Revision as of 13:46, 26 December 2022
(No difference)

alpha>Indicwiki: Created page with "{{Navbox | name = Computational hardness assumptions | title = Computational hardness assumptions | bodyclass = hlist | group1 = Num..."

2022-07-07T05:04:35Z

Created page with "{{Navbox | name = Computational hardness assumptions | title = Computational hardness assumptions | bodyclass = hlist | group1 = Num..."

New page

{{Navbox
| name = Computational hardness assumptions
| title = [[Computational hardness assumption|Computational hardness assumptions]]
| bodyclass = hlist

| group1 = Number theoretic
| list1 =
* [[Integer factorization]]
* [[Phi-hiding assumption|Phi-hiding]]
* [[RSA problem]]
* [[Strong RSA assumption|Strong RSA]]
* [[Quadratic residuosity problem|Quadratic residuosity]]
* [[Decisional composite residuosity assumption|Decisional composite residuosity]]
* [[Higher residuosity problem|Higher residuosity]]

| group2 = Group theoretic
| list2 =
* [[Discrete_logarithm#Cryptography|Discrete logarithm]]
* [[Diffie–Hellman problem|Diffie-Hellman]]
* [[Decisional Diffie–Hellman assumption|Decisional Diffie–Hellman]]
* [[Computational Diffie–Hellman assumption|Computational Diffie–Hellman]]

| group3 = Pairings
| list3 =
* [[XDH assumption|External Diffie–Hellman]]
* [[Sub-group hiding]]
* [[Decision Linear assumption|Decision linear]]

| group4 = Lattices
| list4 =
* [[Lattice_problem#Shortest_vector_problem_(SVP)|Shortest vector problem]] ([[Lattice_problem#GapSVP|gap]])
* [[Lattice_problem#Closest_vector_problem_(CVP)|Closest vector problem]] ([[Lattice_problem#GapCVP|gap]])
* [[Learning with errors]]
* [[Ring learning with errors]]
* [[Short integer solution problem|Short integer solution]]

| group5 = Non-cryptographic
| list5 =
* [[Exponential time hypothesis]]
* [[Unique games conjecture]]
* [[Planted clique|Planted clique conjecture]]
}}<noinclude>
{{documentation | content =
{{collapsible option}}
}}
[[Category:Computer science navigational boxes]]
</noinclude>