commit lambda

Author: EeeUnS

tex_project/number_theory/__rsa.tex

@@ -315,7 +315,7 @@ \section{Carmichael function}
     Here $0 < p−1 < q−1$ , so $n−1$ is not divisible by $q−1$.
 
 
-    https://math.stackexchange.com/questions/432162/carmichael-proof-of-at-least-3-factors
+%    https://math.stackexchange.com/questions/432162/carmichael-proof-of-at-least-3-factors
 
 \end{enumerate}
 
@@ -346,7 +346,7 @@ \section{Carmichael function}
 
 3. the product of at least three primes. 
 
-https://math.stackexchange.com/questions/432162/carmichael-proof-of-at-least-3-factors
+%https://math.stackexchange.com/questions/432162/carmichael-proof-of-at-least-3-factors
 
 
 Assume that $n=pq$, with $p<q$ two distinct primes, is a Carmichael number. 
@@ -359,14 +359,14 @@ \section{Carmichael function}
 
 \section{advanced RSA}
 
-https://crypto.stackexchange.com/questions/26751/rsa-with-lambdan-or-varphin
+%https://crypto.stackexchange.com/questions/26751/rsa-with-lambdan-or-varphin
 
-오리지널은 위와 같지만  PKCS#1 (en) v2.0에 표준 RSA 알고리즘 방식이 바뀌었다.
+오리지널은 위와 같지만  PKCS$\#$1 (en) v2.0에 표준 RSA 알고리즘 방식이 바뀌었다.
 $\phi$ 대신 $\lambda$를 사용하는 방법이다.
 
 Choosing $\lambda(n)$ rather than $\phi(n)$ may result in a smaller private exponent.
 
 
-https://en.wikipedia.org/wiki/RSA_(cryptosystem)
+\url{https://en.wikipedia.org/wiki/RSA_(cryptosystem)}
 
-https://simple.wikipedia.org/wiki/RSA_algorithm
+%https://simple.wikipedia.org/wiki/RSA_algorithm