Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

what is the benefit of lcm in cryptography? and what is the effect of lcm on public key?

note * lcm = Least common multiple


share|improve this question

closed as unclear what you're asking by CodesInChaos, DrLecter, Gilles, e-sushi, poncho Dec 10 '14 at 16:06

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question.If this question can be reworded to fit the rules in the help center, please edit the question.

Lcm or least common multiple is simply a concept in math, it does not have a special meaning (or benefit) in cryptography. The least common multiple of two numbers $x$ and $y$ is simply the smallest number $z$ so that both $x$ and $y$ divide $z$. For example $lcm(9, 30) = 90$ because $90 = 9\cdot10$ and $90 = 3\cdot30$ and there is no smaller number that both $9$ and $30$ divides. – Guut Boy Dec 9 '14 at 13:48
up vote 1 down vote accepted

Regarding public key: In two prime RSA you often compute the secret key from the public as $d=e^{-1} \pmod {(p-1)(q-1)},\;$ but using $d=e^{-1} \pmod {\mathrm{lcm}(p-1,q-1)}$ may have some advantages.

share|improve this answer
Note that it has fewer advantages than you'd hope: if you use the CRT optimization (which most people do), then both $e^{-1} \pmod {(p-1)(q-1)}$ and $e^{-1} \pmod {\mathrm{lcm}(p-1,q-1)}$ lead to the same value of $dp$ and $dq$, and so they operate exactly the same. – poncho Dec 9 '14 at 15:28

Not the answer you're looking for? Browse other questions tagged or ask your own question.