84:
74:
53:
183:
158:
22:
368:
247:
308:
281:
169:
489:
I am an undergraduate student at the
University of Virginia (UVA) and have mostly taught myself the cryptography information. I have worked under a professor on an anonymity topic since ths summer of 2005, and have been the teaching assistant for a cryptography class at UVA. My knowledge in this
558:
I've done some copyedit on the article to help make it more approachable. I am not an expert on the subject though, so it would be nice for someone to read through it and make sure I haven't made any errors. Cheers! -
538:
that the DH problem is hard. In fact, there has been much success towards showing that the DHP is hard, almost as hard as DLP, starting from the work of den Boer, followed by Maurer and Wolf, then Boneh and Lipton.
168:
358:
140:
471:
617:
642:
382:
499:
This looks like a good job, but needs a layman introduction. Think how can you write a few sentences explaining it to a person without your technical background.--
647:
637:
612:
231:
632:
348:
652:
627:
602:
237:
130:
597:
607:
324:
377:
291:
106:
207:
476:
315:
286:
97:
58:
622:
190:
163:
542:
In my opinion, this article should be made shorter, with a quick reference to results such as those I listed, with a point to
262:
or other tool because one or more other projects use this class. Please ensure the assessment is correct before removing the
407:
I am a
Canadian High School student, and unless I'm missing something, this problem is quite simple. Should it not just be
33:
410:
21:
480:
255:
519:
refers to the actual problem of computing g^xy from g^x and g^y not to the "problem" of proving that this
203:
39:
543:
83:
491:
323:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
206:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
105:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
528:
89:
73:
52:
579:
503:
583:
563:
552:
505:
494:
484:
259:
591:
575:
560:
500:
320:
524:
102:
182:
157:
246:
79:
549:
199:
367:
195:
307:
280:
15:
366:
245:
490:
area comes mainly from the journal articles themselves.
523:
is hard, as done in the article. For example, article
413:
546:, which is currently more concise and to the point.
319:, a collaborative effort to improve the coverage of
194:, a collaborative effort to improve the coverage of
101:, a collaborative effort to improve the coverage of
465:
236:This article has not yet received a rating on the
8:
19:
466:{\displaystyle (g^{x})^{\log _{g}(g^{y})}}
275:
152:
47:
618:Automatically assessed Computing articles
452:
436:
431:
421:
412:
643:Low-importance Computer science articles
277:
154:
49:
263:
648:WikiProject Computer science articles
638:Start-Class Computer science articles
613:Unknown-importance Computing articles
501:Piotr Konieczny aka Prokonsul Piotrus
7:
633:Top-importance Cryptography articles
313:This article is within the scope of
188:This article is within the scope of
95:This article is within the scope of
574:Probability presentation is needed
38:It is of interest to the following
570:Probability presentation is needed
333:Knowledge:WikiProject Cryptography
14:
653:WikiProject Cryptography articles
628:Start-Class Cryptography articles
603:Mid-priority mathematics articles
336:Template:WikiProject Cryptography
115:Knowledge:WikiProject Mathematics
598:Start-Class mathematics articles
534:Cryptologists sometimes make an
306:
279:
181:
167:
156:
118:Template:WikiProject Mathematics
82:
72:
51:
20:
353:This article has been rated as
216:Knowledge:WikiProject Computing
135:This article has been rated as
608:Start-Class Computing articles
515:Usually in cryptology, the DH
458:
445:
428:
414:
219:Template:WikiProject Computing
1:
506:22:08, 12 December 2005 (UTC)
495:02:15, 24 November 2005 (UTC)
375:This article is supported by
327:and see a list of open tasks.
210:and see a list of open tasks.
109:and see a list of open tasks.
553:16:01, 31 January 2006 (UTC)
378:WikiProject Computer science
564:03:06, 13 August 2006 (UTC)
531:use problem in this sense.
669:
485:01:12, 27 April 2011 (UTC)
238:project's importance scale
374:
352:
301:
253:
235:
176:
134:
67:
46:
316:WikiProject Cryptography
141:project's priority scale
584:05:15, 4 May 2015 (UTC)
98:WikiProject Mathematics
623:All Computing articles
467:
371:
254:This article has been
250:
204:information technology
28:This article is rated
511:Plan to re-do article
468:
370:
339:Cryptography articles
249:
191:WikiProject Computing
411:
121:mathematics articles
256:automatically rated
529:Discrete logarithm
463:
372:
251:
222:Computing articles
90:Mathematics portal
34:content assessment
544:Discret logarithm
397:
396:
393:
392:
389:
388:
274:
273:
270:
269:
151:
150:
147:
146:
660:
472:
470:
469:
464:
462:
461:
457:
456:
441:
440:
426:
425:
359:importance scale
341:
340:
337:
334:
331:
310:
303:
302:
297:
294:
292:Computer science
283:
276:
265:
224:
223:
220:
217:
214:
185:
178:
177:
172:
171:
170:
160:
153:
123:
122:
119:
116:
113:
92:
87:
86:
76:
69:
68:
63:
55:
48:
31:
25:
24:
16:
668:
667:
663:
662:
661:
659:
658:
657:
588:
587:
572:
513:
487:
448:
432:
427:
417:
409:
408:
405:
338:
335:
332:
329:
328:
295:
289:
221:
218:
215:
212:
211:
166:
120:
117:
114:
111:
110:
88:
81:
61:
32:on Knowledge's
29:
12:
11:
5:
666:
664:
656:
655:
650:
645:
640:
635:
630:
625:
620:
615:
610:
605:
600:
590:
589:
571:
568:
567:
566:
512:
509:
475:
460:
455:
451:
447:
444:
439:
435:
430:
424:
420:
416:
404:
401:
399:
395:
394:
391:
390:
387:
386:
383:Low-importance
373:
363:
362:
355:Top-importance
351:
345:
344:
342:
325:the discussion
311:
299:
298:
296:Top‑importance
284:
272:
271:
268:
267:
252:
242:
241:
234:
228:
227:
225:
208:the discussion
186:
174:
173:
161:
149:
148:
145:
144:
133:
127:
126:
124:
107:the discussion
94:
93:
77:
65:
64:
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
665:
654:
651:
649:
646:
644:
641:
639:
636:
634:
631:
629:
626:
624:
621:
619:
616:
614:
611:
609:
606:
604:
601:
599:
596:
595:
593:
586:
585:
581:
577:
569:
565:
562:
557:
556:
555:
554:
551:
547:
545:
540:
537:
532:
530:
526:
522:
518:
510:
508:
507:
504:
502:
497:
496:
493:
486:
482:
478:
474:
453:
449:
442:
437:
433:
422:
418:
402:
400:
384:
381:(assessed as
380:
379:
369:
365:
364:
360:
356:
350:
347:
346:
343:
326:
322:
318:
317:
312:
309:
305:
304:
300:
293:
288:
285:
282:
278:
261:
257:
248:
244:
243:
239:
233:
230:
229:
226:
209:
205:
201:
197:
193:
192:
187:
184:
180:
179:
175:
165:
162:
159:
155:
142:
138:
132:
129:
128:
125:
108:
104:
100:
99:
91:
85:
80:
78:
75:
71:
70:
66:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
573:
548:
541:
535:
533:
520:
516:
514:
498:
488:
477:50.93.28.170
406:
398:
376:
354:
330:Cryptography
321:Cryptography
314:
287:Cryptography
189:
137:Mid-priority
136:
96:
62:Mid‑priority
40:WikiProjects
525:RSA problem
112:Mathematics
103:mathematics
59:Mathematics
30:Start-class
592:Categories
536:assumption
266:parameter.
492:Batman900
213:Computing
200:computing
196:computers
164:Computing
403:Untitled
576:Jackzhp
561:grubber
521:problem
517:problem
357:on the
139:on the
264:|auto=
202:, and
36:scale.
258:by a
580:talk
550:DRLB
527:and
481:talk
434:log
349:Top
260:bot
232:???
131:Mid
594::
582:)
483:)
473:?
443:
385:).
290::
198:,
578:(
479:(
459:)
454:y
450:g
446:(
438:g
429:)
423:x
419:g
415:(
361:.
240:.
143:.
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
