Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Modular_exponentiation> ?p ?o. }
Showing items 1 to 43 of
43
with 100 items per page.
- Modular_exponentiation abstract "Modular exponentiation is a type of exponentiation performed over a modulus. It is particularly useful in computer science, especially in the field of cryptography.A "modular exponentiation" calculates the remainder when a positive integer b (the base) raised to the e-th power (the exponent), , is divided by a positive integer m, called the modulus. In symbols, given base b, exponent e, and modulus m, the modular exponentiation cis: For example, given b = 5, e = 3, and m = 13, the solution, c = 8, is the remainder of dividing by 13.If b, e, and m are non-negative, and b < m, then a unique solution c exists with the property 0 ≤ c < m.Modular exponentiation can be performed with a negative exponent e by finding the modular multiplicative inverse d of b modulo m using the extended Euclidean algorithm. That is: where e < 0 and Modular exponentiation problems similar to the one described above are considered easy to solve, even when the numbers involved are enormous. On the other hand, computing the discrete logarithm - that is, the task of finding the exponent e if given b, c, and m - is believed to be difficult. This one way function behavior makes modular exponentiation a candidate for use in cryptographic algorithms.".
- Modular_exponentiation wikiPageExternalLink pow.
- Modular_exponentiation wikiPageExternalLink Integer-Exponentiation.html.
- Modular_exponentiation wikiPageExternalLink Int.Exp.
- Modular_exponentiation wikiPageExternalLink pow.
- Modular_exponentiation wikiPageExternalLink bmodpow%28%29.
- Modular_exponentiation wikiPageExternalLink 1482.
- Modular_exponentiation wikiPageExternalLink FastPow.html.
- Modular_exponentiation wikiPageExternalLink function.bcpowmod.php.
- Modular_exponentiation wikiPageID "903032".
- Modular_exponentiation wikiPageRevisionID "597521911".
- Modular_exponentiation hasPhotoCollection Modular_exponentiation.
- Modular_exponentiation subject Category:Cryptographic_algorithms.
- Modular_exponentiation subject Category:Modular_arithmetic.
- Modular_exponentiation subject Category:Number_theoretic_algorithms.
- Modular_exponentiation type Abstraction100002137.
- Modular_exponentiation type Act100030358.
- Modular_exponentiation type Activity100407535.
- Modular_exponentiation type Algorithm105847438.
- Modular_exponentiation type CryptographicAlgorithms.
- Modular_exponentiation type Event100029378.
- Modular_exponentiation type NumberTheoreticAlgorithms.
- Modular_exponentiation type Procedure101023820.
- Modular_exponentiation type PsychologicalFeature100023100.
- Modular_exponentiation type Rule105846932.
- Modular_exponentiation type YagoPermanentlyLocatedEntity.
- Modular_exponentiation comment "Modular exponentiation is a type of exponentiation performed over a modulus. It is particularly useful in computer science, especially in the field of cryptography.A "modular exponentiation" calculates the remainder when a positive integer b (the base) raised to the e-th power (the exponent), , is divided by a positive integer m, called the modulus.".
- Modular_exponentiation label "Diskrete Exponentialfunktion".
- Modular_exponentiation label "Exponenciación modular".
- Modular_exponentiation label "Exponentiation modulaire".
- Modular_exponentiation label "Modular exponentiation".
- Modular_exponentiation label "冪剰余".
- Modular_exponentiation sameAs Modulární_umocňování.
- Modular_exponentiation sameAs Diskrete_Exponentialfunktion.
- Modular_exponentiation sameAs Exponenciación_modular.
- Modular_exponentiation sameAs Exponentiation_modulaire.
- Modular_exponentiation sameAs 冪剰余.
- Modular_exponentiation sameAs m.03ndln.
- Modular_exponentiation sameAs Q1228841.
- Modular_exponentiation sameAs Q1228841.
- Modular_exponentiation sameAs Modular_exponentiation.
- Modular_exponentiation wasDerivedFrom Modular_exponentiation?oldid=597521911.
- Modular_exponentiation isPrimaryTopicOf Modular_exponentiation.