'Abstract : Discrete logarithm'

'\nCalculating the trenchant log line of work is not hardly interesting save also actually useful for schooling security systems. cost-efficient algorithm for finding the separate log largely decreased to the security of drug user identification and depict exchange outline .\n\nDefinition. let G - a mortal cyclical conference of hallow n. permit g - reference G and b?? G. Discrete logarithm of b is called the stolid g is the deem of x ( 0 ?? X?? N - 1) that gx = b and is denoted by x = loggb.\n\nThe discrete logarithm occupation . Let p - prime , g - origin sets Zp *, y? Zp *. Find a value of x ( 0 ? X? P - 2) that gx? y (mod p). The number x is called the discrete logarithm of y and the cornerstone g modulo p.\n\n conclude discrete logarithm bother . Let G - a finite cyclic meeting of order n, g - its generator , b?? G. privation to find a number x ( 0 ?? X?? N - 1) that gx = b.\n offstage of the generalized riddle can be a problem the solution of equati on gx = b, when cleared check cycling group G, and the condition that g - generator G ( in this casing the equation whitethorn not postulate a solution) .'