53:
75:
80:
269:
23:. Such an assumption conjectures that the corresponding computational problem is hard. Most of the time hard is meant to mean not to be solved by a
279:
58:
16:
284:
274:
216:
211:
177:
40:
27:
107:
85:
148:
119:
95:
70:
189:
238:
221:
160:
131:
90:
20:
226:
143:
24:
250:
206:
165:
263:
194:
39:
The following 25 pages are in this category, out of 25 total.
19:
play an important role in cryptography; in particular for
36:
Pages in category "Computational hardness assumptions"
8:
76:Decisional composite residuosity assumption
41:This list may not reflect recent changes
54:Computational Diffie–Hellman assumption
7:
81:Decisional Diffie–Hellman assumption
45:
33:
17:Computational hardness assumptions
14:
59:Computational hardness assumption
270:Computational complexity theory
217:Small set expansion hypothesis
212:Short integer solution problem
1:
178:Quadratic residuosity problem
28:probabilistic Turing machine
108:Exponential time hypothesis
301:
149:Logjam (computer security)
120:Higher residuosity problem
96:Discrete logarithm records
71:Decision Linear assumption
190:Ring learning with errors
280:Cryptographic primitives
285:Public-key cryptography
239:Unique games conjecture
275:Theory of cryptography
86:Diffie–Hellman problem
222:Strong RSA assumption
161:Phi-hiding assumption
132:Integer factorization
91:Discrete logarithm
21:Provable security
292:
227:Sub-group hiding
300:
299:
295:
294:
293:
291:
290:
289:
260:
259:
258:
257:
256:
255:
243:
231:
199:
182:
170:
153:
144:Lattice problem
136:
124:
112:
100:
63:
32:
25:polynomial time
12:
11:
5:
298:
296:
288:
287:
282:
277:
272:
262:
261:
254:
253:
251:XDH assumption
247:
244:
242:
241:
235:
232:
230:
229:
224:
219:
214:
209:
207:Security level
203:
200:
198:
197:
192:
186:
183:
181:
180:
174:
171:
169:
168:
166:Planted clique
163:
157:
154:
152:
151:
146:
140:
137:
135:
134:
128:
125:
123:
122:
116:
113:
111:
110:
104:
101:
99:
98:
93:
88:
83:
78:
73:
67:
64:
62:
61:
56:
50:
47:
46:
37:
34:
13:
10:
9:
6:
4:
3:
2:
297:
286:
283:
281:
278:
276:
273:
271:
268:
267:
265:
252:
249:
248:
245:
240:
237:
236:
233:
228:
225:
223:
220:
218:
215:
213:
210:
208:
205:
204:
201:
196:
193:
191:
188:
187:
184:
179:
176:
175:
172:
167:
164:
162:
159:
158:
155:
150:
147:
145:
142:
141:
138:
133:
130:
129:
126:
121:
118:
117:
114:
109:
106:
105:
102:
97:
94:
92:
89:
87:
84:
82:
79:
77:
74:
72:
69:
68:
65:
60:
57:
55:
52:
51:
48:
44:
42:
35:
31:
29:
26:
22:
18:
38:
15:
195:RSA problem
264:Categories
266::
43:.
30:.
246:X
234:U
202:S
185:R
173:Q
156:P
139:L
127:I
115:H
103:E
66:D
49:C
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.