First Page | Document Content | |
---|---|---|
Date: 2007-10-10 03:07:41Abstract algebra Algebra Mathematics Group theory Computational hardness assumptions Logarithms Modular arithmetic Finite fields Discrete logarithm Randomized algorithm Pollard's rho algorithm Index calculus algorithm | On the Efficiency of Pollard’s Rho Method for Discrete Logarithms Shi Bai1 1 2Add to Reading ListSource URL: maths-people.anu.edu.auDownload Document from Source WebsiteFile Size: 234,92 KBShare Document on Facebook |
ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 1: Group Theory 1DocID: 1xVrN - View Document | |
Group Henzinger Software Systems Theory Systems Biology Group membersDocID: 1xV3x - View Document | |
Lecture notes: Basic group and representation theory Thomas Willwacher February 27, 2014 2DocID: 1xUQE - View Document | |
SPNs: Network Reconstruction Theory and Speedup Using Neural Networks Balaji Prabhakar and Mendel Rosenblum Self-‐Programming Networks Research Group StanfDocID: 1xTIn - View Document | |
XFindBugs: eXtended FindBugs for AspectJ Haihao Shen, Sai Zhang, Jianjun Zhao, Jianhong Fang, Shiyuan Yao Software Theory and Practice Group (STAP) Shanghai Jiao Tong University, China A codeDocID: 1xTFA - View Document |