{"id":48257,"date":"2018-08-14T17:38:41","date_gmt":"2018-08-14T12:08:41","guid":{"rendered":"https:\/\/hindi.theindianwire.com\/?p=48257"},"modified":"2018-08-14T17:38:41","modified_gmt":"2018-08-14T12:08:41","slug":"rsa-%e0%a4%8f%e0%a4%b2%e0%a5%8d%e0%a4%97%e0%a5%8b%e0%a4%b0%e0%a4%bf%e0%a4%a5%e0%a5%8d%e0%a4%ae","status":"publish","type":"post","link":"https:\/\/hindi.theindianwire.com\/rsa-%e0%a4%8f%e0%a4%b2%e0%a5%8d%e0%a4%97%e0%a5%8b%e0%a4%b0%e0%a4%bf%e0%a4%a5%e0%a5%8d%e0%a4%ae-48257\/","title":{"rendered":"\u0915\u094d\u0930\u093f\u092a\u094d\u091f\u094b\u0917\u094d\u0930\u093e\u092b\u0940 \u092e\u0947\u0902 RSA \u090f\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u094d\u092e \u0915\u0947 \u092c\u093e\u0930\u0947 \u092e\u0947\u0902 \u0909\u0938\u0915\u0947 \u0915\u094b\u0921 \u0915\u0947 \u0938\u093e\u0925 \u091c\u093e\u0928\u0947"},"content":{"rendered":"\n<h3>RSA\u00a0\u090f\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u094d\u092e \u0915\u094d\u092f\u093e \u0939\u0948? (rsa algorithm in cryptography in hindi)<\/h3>\n<p>RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u090f\u0915 asymmetric \u0915\u094d\u0930\u093f\u092a\u094d\u091f\u094b\u0917\u094d\u0930\u093e\u095e\u0940 \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0939\u0948\u0964 Asymmetric \u0915\u093e \u092f\u0939\u093e\u0901 \u092a\u0930 \u0905\u0930\u094d\u0925 \u0939\u0941\u0906 \u092f\u0947 \u0926\u094b \u0905\u0932\u0917-\u0905\u0932\u0917 key \u092a\u0930 \u0915\u093e\u0930\u094d\u092f \u0915\u0930\u0924\u093e \u0939\u0948-\u092a\u092c\u094d\u0932\u093f\u0915 key \u090f\u0909\u0930 \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f key.<\/p>\n<p>\u091c\u0948\u0938\u093e \u0915\u093f \u0907\u0938\u0915\u0947 \u0928\u093e\u092e \u0938\u0947 \u092a\u0924\u093e \u091a\u0932\u0924\u093e \u0939\u0948, \u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u094b \u0938\u092d\u0940 \u0915\u094b \u0926\u093f\u092f\u093e \u091c\u093e\u0924\u093e \u0939\u0948 \u091c\u092c\u0915\u093f \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f \u0915\u0930\u0940 \u0915\u094b \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f \u0930\u0916\u093e \u091c\u093e\u0924\u093e \u0939\u0948\u0964<\/p>\n<p><strong>Asymmetric \u0915\u094d\u0930\u093f\u092a\u094d\u091f\u094b\u0917\u094d\u0930\u093e\u095e\u0940 \u0915\u093e \u0909\u0926\u093e\u0939\u0930\u0923: <\/strong><\/p>\n<ol>\n<li>\u00a0\u090f\u0915 \u0915\u094d\u0932\u093e\u0907\u0902\u091f (\u091c\u0948\u0938\u0947 \u0915\u093f \u092c\u094d\u0930\u093e\u0909\u095b\u0930) \u0905\u092a\u0928\u0947 \u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u094b \u0938\u0930\u094d\u0935\u0930 \u0915\u094b \u092d\u0947\u091c\u0924\u093e \u0939\u0948 \u0914\u0930 \u0915\u0941\u091b \u0921\u093e\u091f\u093e \u0915\u0947 \u0932\u093f\u090f \u0928\u093f\u0935\u0947\u0926\u0928 \u0915\u0930\u0924\u093e \u0939\u0948\u0964<\/li>\n<li>\u0909\u0938\u0915\u0947 \u092c\u093e\u0926 \u0938\u0930\u094d\u0935\u0930 \u0915\u094d\u0932\u093e\u0907\u0902\u091f \u0915\u0947 \u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u093e \u092a\u094d\u0930\u092f\u094b\u0917 \u0915\u0930 \u0915\u0947 \u0909\u0938 \u0921\u093e\u091f\u093e \u0915\u094b \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u0930\u0924\u093e \u0939\u0948 \u0914\u0930 \u0909\u0938 \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u093f\u092f\u0947 \u0939\u0941\u090f \u0921\u093e\u091f\u093e \u0915\u094b \u092d\u0947\u091c\u0924\u093e \u0939\u0948\u0964<\/li>\n<li>\u0909\u0938\u0947\u0915 \u092c\u093e\u0926 \u0915\u094d\u0932\u093e\u0907\u0902\u091f \u0909\u0938 \u0921\u093e\u091f\u093e \u0915\u094b \u092a\u094d\u0930\u093e\u092a\u094d\u0924 \u0915\u0930 \u0915\u0947 \u0921\u093f\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u0930\u0924\u093e \u0939\u0948\u0964<\/li>\n<\/ol>\n<p>Since this is asymmetric, nobody else except browser can decrypt the data even if a third party has public key of browser. \u091a\u0942\u0901\u0915\u093f \u092f\u0947 \u0905\u0938\u093f\u092e\u0947\u091f\u094d\u0930\u093f\u0915 \u0939\u0948, \u0907\u0938\u0940\u0932\u093f\u090f \u092c\u094d\u0930\u093e\u0909\u095b\u0930 \u0915\u0947 \u0905\u0932\u093e\u0935\u0947 \u0915\u094b\u0908 \u092d\u0940 \u0907\u0938\u0947 \u0921\u093f\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0928\u0939\u0940\u0902 \u0915\u0930 \u0938\u0915\u0924\u093e \u092d\u0932\u0947 \u0939\u0940 \u0915\u093f\u0938\u0940 \u0925\u0930\u094d\u0921 \u092a\u093e\u0930\u094d\u091f\u0940 \u0915\u0947 \u092a\u093e\u0938 \u092c\u094d\u0930\u093e\u0909\u095b\u0930 \u0915\u093e \u092a\u092c\u094d\u0932\u093f\u0915 key \u0939\u0940 \u0915\u094d\u092f\u094b\u0902 \u0928 \u0939\u094b\u0964<\/p>\n<h3>RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0915\u0940 \u0915\u093e\u0930\u094d\u092f\u092a\u094d\u0930\u0923\u093e\u0932\u0940 (working of\u00a0rsa algorithm in hindi)<\/h3>\n<p>RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0915\u093e \u0935\u093f\u091a\u093e\u0930 \u0907\u0938 \u092c\u093e\u0924 \u092a\u0930 \u0906\u0927\u093e\u0930\u093f\u0924 \u0939\u0948 \u0915\u093f \u092c\u095c\u0947 \u0907\u0928\u094d\u091f\u093f\u091c\u0930 \u0915\u094b \u092b\u0948\u0915\u094d\u091f\u0930 \u0915\u0930\u0928\u093e \u0915\u093e\u092b\u0940 \u092e\u0941\u0936\u094d\u0915\u093f\u0932 \u0915\u093e\u092e \u0939\u0948\u0964 \u092a\u092c\u094d\u0932\u093f\u0915 key \u0926\u094b \u0938\u0902\u0916\u094d\u092f\u093e\u0913\u0902 \u0915\u094b \u092e\u093f\u0932\u093e \u0915\u0930 \u092c\u0928\u093e \u0939\u094b\u0924\u093e \u0939\u0948 \u091c\u093f\u0938\u092e\u0947 \u0938\u0947 \u090f\u0915 \u0938\u0902\u0916\u094d\u092f\u093e \u0926\u094b \u092c\u095c\u0947 \u092a\u094d\u0930\u093e\u0907\u092e \u0938\u0902\u0916\u094d\u092f\u093e \u0915\u093e \u0917\u0941\u0928\u093e \u0939\u094b\u0924\u093e \u0939\u0948\u0964<\/p>\n<p>\u090f\u0915 \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f key \u0915\u094b \u092d\u0940 \u0907\u0924\u0928\u0940 \u0926\u094b \u092a\u094d\u0930\u093e\u0907\u092e \u0938\u0902\u0916\u094d\u092f\u093e \u0938\u0947 \u092e\u093f\u0932\u093e\u0915\u0930 \u092c\u0928\u093e\u092f\u093e \u091c\u093e\u0924\u093e \u0939\u0948\u0964 \u0907\u0938\u0940\u0932\u093f\u090f \u0905\u0917\u0930 \u0915\u094b\u0908 \u092c\u095c\u0940 \u0938\u0902\u0916\u094d\u092f\u093e \u0915\u094b \u092b\u0948\u0915\u094d\u091f\u0930 \u0915\u0930 \u0938\u0915\u0924\u093e \u0939\u0948 \u0924\u094b \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f key \u0915\u094b \u0915\u094b\u092e\u094d\u092a\u094d\u0930\u094b\u092e\u093e\u0908\u095b \u0915\u093f\u092f\u093e \u091c\u093e \u0938\u0915\u0924\u093e \u0939\u0948\u0964<\/p>\n<p>\u0907\u0938\u0940\u0932\u093f\u090f \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u0936\u0928 \u0915\u0940 \u092a\u0942\u0930\u0940 \u092e\u091c\u092c\u0942\u0930\u0940 key \u0915\u0947 \u0906\u0915\u093e\u0930 \u092a\u0930 \u0928\u093f\u0930\u094d\u092d\u0930 \u0915\u0930\u0924\u0940 \u0939\u0948 \u0914\u0930 \u0905\u0917\u0930 \u0939\u092e key \u0938\u093e\u0907\u095b \u0915\u094b \u0926\u0941\u0917\u0941\u0928\u093e \u092f\u093e \u0924\u093f\u0917\u0941\u0928\u093e \u0915\u0930\u0924\u0947 \u0939\u0948\u0902 \u0924\u094b \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u0936\u0928 \u0915\u0940 \u092e\u091c\u092c\u0942\u0924\u0940 \u092d\u0940 \u0915\u093e\u092b\u0940 \u091c\u094d\u092f\u093e\u0926\u093e \u092c\u095d \u091c\u093e\u0924\u0940 \u0939\u0948\u0964<\/p>\n<p>RSA \u0915\u0947 key \u0905\u0927\u093f\u0915\u0924\u0930 1024 \u092f\u093e 2048 \u092c\u093f\u091f \u0932\u092e\u094d\u092c\u0947 \u0939\u094b\u0924\u0947 \u0939\u0948\u0902 \u0932\u0947\u0915\u093f\u0928 \u0905\u092c \u090f\u0915\u094d\u0938\u092a\u0930\u094d\u091f \u0932\u094b\u0917\u094b\u0902 \u0915\u093e \u092e\u0928\u094d\u0928\u093e \u0939\u0948 \u0915\u093f \u0928\u093f\u0915\u091f \u092d\u0935\u093f\u0937\u094d\u092f \u092e\u0947\u0902 1024 \u092c\u093f\u091f \u0915\u0947 key \u0915\u094b \u0924\u094b\u095c\u093e \u091c\u093e \u0938\u0915\u0924\u093e \u0939\u0948\u0964 \u0932\u0947\u0915\u093f\u0928 \u0905\u092d\u0940 \u0924\u0915 \u0924\u094b \u0910\u0938\u093e \u0915\u0941\u091b \u0928\u0939\u0940\u0902 \u0939\u0941\u0906 \u0939\u0948\u0964<\/p>\n<h3>RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0915\u093e \u092e\u0948\u0915\u0947\u0928\u093f\u091c\u094d\u092e (mechanism of\u00a0rsa algorithm in hindi)<\/h3>\n<p>\u092a\u092c\u094d\u0932\u093f\u0915 key generate \u0915\u0930\u0928\u0947 \u0915\u0947 \u0932\u093f\u090f:<\/p>\n<ul>\n<li>\u0926\u094b \u092a\u094d\u0930\u093e\u0907\u092e \u0938\u0902\u0916\u094d\u092f\u093e \u091a\u0941\u0928\u0947\u0964 Suppose <strong>P = 53 and Q = 59<\/strong>.<br \/>\n\u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u093e \u092a\u0939\u0932\u093e \u092d\u093e\u0917 : <strong>n = P*Q = 3127<\/strong>.<\/li>\n<li>\u0939\u092e\u0947 \u090f\u0915 \u091b\u094b\u091f\u093e \u090f\u0915\u094d\u0938\u094d\u092a\u094b\u0928\u0947\u0902\u091f \u092d\u0940 \u091a\u093e\u0939\u093f\u090f, \u091c\u0948\u0938\u0947 <strong>e<\/strong> :<br \/>\n\u0932\u0947\u0915\u093f\u0928 e \u0915\u094b \u0939\u094b\u0928\u093e \u091a\u093e\u0939\u093f\u090f:<\/p>\n<ul>\n<li>\u090f\u0915 \u0907\u0928\u094d\u091f\u093f\u091c\u0930<\/li>\n<li>\u0914\u0930 n \u0915\u093e \u092b\u0948\u0915\u094d\u091f\u0930 \u0928\u0939\u0940\u0902 \u0939\u094b\u0928\u093e \u091a\u093e\u0939\u093f\u090f\u0964<\/li>\n<li><strong>1 &lt; e &lt; \u03a6(n)<\/strong> [\u03a6(n) \u0915\u094b \u0928\u0940\u091a\u0947 \u092c\u0924\u093e\u092f\u093e \u0917\u092f\u093e \u0939\u0948],<br \/>\n\u0905\u092c \u092e\u093e\u0928\u0924\u0947 \u0939\u0948\u0902 \u0915\u093f \u092f\u0947 3 \u0915\u0947 \u092c\u0930\u093e\u092c\u0930 \u0939\u094b\u0917\u093e\u0964<\/li>\n<\/ul>\n<\/li>\n<li>\u0939\u092e\u093e\u0930\u093e \u092a\u092c\u094d\u0932\u093f\u0915 key n \u0914\u0930 e\u0907 \u0938\u0947 \u092c\u0928\u093e \u0939\u0948\u0964<\/li>\n<\/ul>\n<p>\u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f key generate \u0915\u0930\u0928\u0947 \u0915\u0947 \u0932\u093f\u090f:<\/p>\n<ul>\n<li>\u0939\u092e\u0947 \u0915\u0948\u0932\u0915\u0941\u0932\u0947\u091f \u0915\u0930\u0928\u093e \u0939\u0948 \u03a6(n) :<br \/>\n\u091c\u0948\u0938\u0947 \u0915\u093f, <strong>\u03a6(n) = (P-1)(Q-1)<\/strong><br \/>\n\u0907\u0938\u0940\u0932\u093f\u090f, \u03a6(n) = 3016<\/li>\n<li>\u0905\u092c \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f key \u0915\u093e \u0915\u0948\u0932\u0915\u0941\u0932\u0947\u0936\u0928, <strong>d<\/strong> :<br \/>\n<strong>d = (k*\u03a6(n) + 1) \/ e<\/strong> for some integer k<br \/>\nk = 2 \u0915\u0947 \u0932\u093f\u090f, d \u0915\u093e \u092e\u093e\u0928 \u0939\u094b\u0917\u093e 2011.<\/li>\n<\/ul>\n<p>\u0905\u092c \u0939\u092e\u093e\u0930\u0947 \u092a\u093e\u0938 \u0939\u0948 \u0939\u092e\u093e\u0930\u0947 \u092a\u092c\u094d\u0932\u093f\u0915 key ( n = 3127 and e = 3) \u0914\u0930 \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f Key (d = 2011)\u0964<\/p>\n<h3>RSA \u0915\u093e \u0909\u0926\u093e\u0939\u0930\u0923 (rsa algorithm example in hindi)<\/h3>\n<p>\u0906\u0907\u092f\u0947 \u0905\u092c \u0939\u092e<strong> \u201cHI\u201d<\/strong> \u0915\u094b \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u0930 \u0915\u0947 \u0926\u0947\u0915\u094d\u0932\u094d\u0939\u0924\u0947 \u0939\u0948\u0902 \u0915\u093f \u092f\u0947 \u092a\u094d\u0930\u0915\u094d\u0930\u093f\u092f\u093e \u0915\u0948\u0938\u0947 \u0915\u093e\u092e \u0915\u0930\u0924\u0940 \u0939\u0948:<\/p>\n<ul>\n<li>\u092a\u0939\u0932\u0947 \u0905\u0915\u094d\u0937\u0930 \u0915\u094b \u0938\u0902\u0916\u094d\u092f\u093e \u092e\u0947\u0902 \u092c\u0926\u0932\u0947 : H = 8 and I = 9<\/li>\n<li>\u0907\u0938\u0940\u0932\u093f\u090f <strong>Encrypted Data c = 89<sup>e<\/sup> mod n<\/strong>.<br \/>\n\u0905\u092c \u0939\u092e\u093e\u0930\u093e \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u093f\u092f\u093e \u0939\u0941\u0906 \u0921\u093e\u091f\u093e \u0939\u094b\u0917\u093e\u00a0 1394<\/li>\n<\/ul>\n<pre>\u0905\u092c \u0939\u092e <strong>1394<\/strong> \u0915\u094b \u0921\u093f\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u0930\u0947\u0902\u0917\u0947:<\/pre>\n<ul>\n<li><strong>Decrypted Data = c<sup>d<\/sup> mod n<\/strong>.<br \/>\n\u0907\u0938\u0940\u0932\u093f\u090f \u0939\u092e\u093e\u0930\u0947 \u090f\u0928\u094d\u0915\u094d\u0930\u093f\u092a\u094d\u091f \u0915\u093f\u092f\u093e \u0939\u0941\u0906 \u0921\u093e\u091f\u093e \u0939\u094b\u0917\u093e 89<\/li>\n<\/ul>\n<pre><strong>8 = H \u0914\u0930 I = 9 i.e. \"HI\".<\/strong><\/pre>\n<h3>RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0915\u093e \u0915\u094b\u0921 (rsa algorithm code in hindi)<\/h3>\n<p>\u0905\u092c \u0939\u092e \u0906\u092a\u0915\u094b \u091b\u094b\u091f\u0947 \u092e\u093e\u0928\u094b\u0902 \u0915\u0947 \u0932\u093f\u090f RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0915\u093e C\u0915 \u0915\u094b\u0921 \u0926\u093f\u0916\u093e \u0930\u0939\u0947 \u0939\u0948\u0902:<\/p>\n<div class=\"line number1 index0 alt2\"><code class=\"c comments\">RSA \u0905\u0938\u093f\u092e\u0947\u091f\u094d\u0930\u093f\u0915 \u0915\u094d\u0930\u093f\u092a\u094d\u091f\u094b\u0917\u094d\u0930\u093e\u095e\u0940 \u0915\u093e \u092a\u094d\u0930\u094b\u0917\u094d\u0930\u093e\u092e <\/code><\/div>\n<div class=\"line number2 index1 alt1\"><code class=\"c comments\">\/\/ algorithm. For demonstration values are<\/code><\/div>\n<div class=\"line number3 index2 alt2\"><code class=\"c comments\">\/\/ relatively small compared to practical<\/code><\/div>\n<div class=\"line number4 index3 alt1\"><code class=\"c comments\">\/\/ application<\/code><\/div>\n<div class=\"line number5 index4 alt2\"><code class=\"c preprocessor\">#include&lt;stdio.h&gt;<\/code><\/div>\n<div class=\"line number6 index5 alt1\"><code class=\"c preprocessor\">#include&lt;math.h&gt;<\/code><\/div>\n<div class=\"line number7 index6 alt2\"><\/div>\n<div class=\"line number8 index7 alt1\"><code class=\"c comments\">\/\/ Returns gcd of a and b<\/code><\/div>\n<div class=\"line number9 index8 alt2\"><code class=\"c color1 bold\">int<\/code> <code class=\"c plain\">gcd(<\/code><code class=\"c color1 bold\">int<\/code> <code class=\"c plain\">a, <\/code><code class=\"c color1 bold\">int<\/code> <code class=\"c plain\">h)<\/code><\/div>\n<div class=\"line number10 index9 alt1\"><code class=\"c plain\">{<\/code><\/div>\n<div class=\"line number11 index10 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">int<\/code> <code class=\"c plain\">temp;<\/code><\/div>\n<div class=\"line number12 index11 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">while<\/code> <code class=\"c plain\">(1)<\/code><\/div>\n<div class=\"line number13 index12 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">{<\/code><\/div>\n<div class=\"line number14 index13 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">temp = a%h;<\/code><\/div>\n<div class=\"line number15 index14 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">if<\/code> <code class=\"c plain\">(temp == 0)<\/code><\/div>\n<div class=\"line number16 index15 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">return<\/code> <code class=\"c plain\">h;<\/code><\/div>\n<div class=\"line number17 index16 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">a = h;<\/code><\/div>\n<div class=\"line number18 index17 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">h = temp;<\/code><\/div>\n<div class=\"line number19 index18 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">}<\/code><\/div>\n<div class=\"line number20 index19 alt1\"><code class=\"c plain\">}<\/code><\/div>\n<div class=\"line number21 index20 alt2\"><\/div>\n<div class=\"line number22 index21 alt1\"><code class=\"c comments\">\/\/ Code to demonstrate RSA algorithm<\/code><\/div>\n<div class=\"line number23 index22 alt2\"><code class=\"c color1 bold\">int<\/code> <code class=\"c plain\">main()<\/code><\/div>\n<div class=\"line number24 index23 alt1\"><code class=\"c plain\">{<\/code><\/div>\n<div class=\"line number25 index24 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ \u0926\u094b \u0930\u0948\u0902\u0921\u092e \u092a\u094d\u0930\u093e\u0907\u092e \u0938\u0902\u0916\u094d\u092f\u093e<\/code><\/div>\n<div class=\"line number26 index25 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">p = 3;<\/code><\/div>\n<div class=\"line number27 index26 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">q = 7;<\/code><\/div>\n<div class=\"line number28 index27 alt1\"><\/div>\n<div class=\"line number29 index28 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/\u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u093e \u092a\u0939\u0932\u093e \u092d\u093e\u0917<br \/>\n<\/code><\/div>\n<div class=\"line number30 index29 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">n = p*q;<\/code><\/div>\n<div class=\"line number31 index30 alt2\"><\/div>\n<div class=\"line number32 index31 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ \u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u093e \u0926\u0942\u0938\u0930\u093e \u092d\u093e\u0917 \u092a\u0924\u093e \u0915\u0930\u0928\u0947 \u0915\u0947 \u0932\u093f\u090f<\/code><\/div>\n<div class=\"line number33 index32 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ e stands for encrypt<\/code><\/div>\n<div class=\"line number34 index33 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">e = 2;<\/code><\/div>\n<div class=\"line number35 index34 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">phi = (p-1)*(q-1);<\/code><\/div>\n<div class=\"line number36 index35 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">while<\/code> <code class=\"c plain\">(e &lt; phi)<\/code><\/div>\n<div class=\"line number37 index36 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">{<\/code><\/div>\n<div class=\"line number38 index37 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ e must be co-prime to phi and<\/code><\/div>\n<div class=\"line number39 index38 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ smaller than phi.<\/code><\/div>\n<div class=\"line number40 index39 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">if<\/code> <code class=\"c plain\">(gcd(e, phi)==1)<\/code><\/div>\n<div class=\"line number41 index40 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">break<\/code><code class=\"c plain\">;<\/code><\/div>\n<div class=\"line number42 index41 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">else<\/code><\/div>\n<div class=\"line number43 index42 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">e++;<\/code><\/div>\n<div class=\"line number44 index43 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">}<\/code><\/div>\n<div class=\"line number45 index44 alt2\"><\/div>\n<div class=\"line number46 index45 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ Private key (d stands for decrypt)<\/code><\/div>\n<div class=\"line number47 index46 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ choosing d such that it satisfies<\/code><\/div>\n<div class=\"line number48 index47 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ d*e = 1 + k * totient<\/code><\/div>\n<div class=\"line number49 index48 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">int<\/code> <code class=\"c plain\">k = 2;\u00a0 <\/code><code class=\"c comments\">\/\/ A constant value<\/code><\/div>\n<div class=\"line number50 index49 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">d = (1 + (k*phi))\/e;<\/code><\/div>\n<div class=\"line number51 index50 alt2\"><\/div>\n<div class=\"line number52 index51 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ Message to be encrypted<\/code><\/div>\n<div class=\"line number53 index52 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">msg = 20;<\/code><\/div>\n<div class=\"line number54 index53 alt1\"><\/div>\n<div class=\"line number55 index54 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c functions bold\">printf<\/code><code class=\"c plain\">(<\/code><code class=\"c string\">\"Message data = %lf\"<\/code><code class=\"c plain\">, msg);<\/code><\/div>\n<div class=\"line number56 index55 alt1\"><\/div>\n<div class=\"line number57 index56 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ Encryption c = (msg ^ e) % n<\/code><\/div>\n<div class=\"line number58 index57 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">c = <\/code><code class=\"c functions bold\">pow<\/code><code class=\"c plain\">(msg, e);<\/code><\/div>\n<div class=\"line number59 index58 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">c = <\/code><code class=\"c functions bold\">fmod<\/code><code class=\"c plain\">(c, n);<\/code><\/div>\n<div class=\"line number60 index59 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c functions bold\">printf<\/code><code class=\"c plain\">(<\/code><code class=\"c string\">\"\\nEncrypted data = %lf\"<\/code><code class=\"c plain\">, c);<\/code><\/div>\n<div class=\"line number61 index60 alt2\"><\/div>\n<div class=\"line number62 index61 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c comments\">\/\/ Decryption m = (c ^ d) % n<\/code><\/div>\n<div class=\"line number63 index62 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c color1 bold\">double<\/code> <code class=\"c plain\">m = <\/code><code class=\"c functions bold\">pow<\/code><code class=\"c plain\">(c, d);<\/code><\/div>\n<div class=\"line number64 index63 alt1\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c plain\">m = <\/code><code class=\"c functions bold\">fmod<\/code><code class=\"c plain\">(m, n);<\/code><\/div>\n<div class=\"line number65 index64 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c functions bold\">printf<\/code><code class=\"c plain\">(<\/code><code class=\"c string\">\"\\nOriginal Message Sent = %lf\"<\/code><code class=\"c plain\">, m);<\/code><\/div>\n<div class=\"line number66 index65 alt1\"><\/div>\n<div class=\"line number67 index66 alt2\"><code class=\"c spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"c keyword bold\">return<\/code> <code class=\"c plain\">0;<\/code><\/div>\n<p>&nbsp;<\/p>\n<p>\u0907\u0938 \u0915\u094b\u0921 \u0915\u093e \u0906\u0909\u091f\u092a\u0941\u091f \u0939\u094b\u0917\u093e:<\/p>\n<pre>Message data = 12.000000\r\nEncrypted data = 3.000000\r\nOriginal Message Sent = 12.000000<\/pre>\n<p><em>\u0907\u0938 \u0932\u0947\u0916 \u0938\u0947 \u0938\u092e\u094d\u092c\u0902\u0927\u093f\u0924 \u092f\u0926\u093f \u0906\u092a\u0915\u093e \u0915\u094b\u0908 \u092d\u0940 \u0938\u0935\u093e\u0932 \u092f\u093e \u0938\u0941\u091d\u093e\u0935 \u0939\u0948, \u0924\u094b \u0906\u092a \u0909\u0938\u0947 \u0928\u0940\u091a\u0947 \u0915\u092e\u0947\u0902\u091f \u092e\u0947\u0902 \u0932\u093f\u0916 \u0938\u0915\u0924\u0947 \u0939\u0948\u0902\u0964<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"<p>RSA\u00a0\u090f\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u094d\u092e \u0915\u094d\u092f\u093e \u0939\u0948? (rsa algorithm in cryptography in hindi) RSA \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u090f\u0915 asymmetric \u0915\u094d\u0930\u093f\u092a\u094d\u091f\u094b\u0917\u094d\u0930\u093e\u095e\u0940 \u0905\u0932\u094d\u0917\u094b\u0930\u093f\u0925\u092e \u0939\u0948\u0964 Asymmetric \u0915\u093e \u092f\u0939\u093e\u0901 \u092a\u0930 \u0905\u0930\u094d\u0925 \u0939\u0941\u0906 \u092f\u0947 \u0926\u094b \u0905\u0932\u0917-\u0905\u0932\u0917 key \u092a\u0930 \u0915\u093e\u0930\u094d\u092f \u0915\u0930\u0924\u093e \u0939\u0948-\u092a\u092c\u094d\u0932\u093f\u0915 key \u090f\u0909\u0930 \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f key. \u091c\u0948\u0938\u093e \u0915\u093f \u0907\u0938\u0915\u0947 \u0928\u093e\u092e \u0938\u0947 \u092a\u0924\u093e \u091a\u0932\u0924\u093e \u0939\u0948, \u092a\u092c\u094d\u0932\u093f\u0915 key \u0915\u094b \u0938\u092d\u0940 \u0915\u094b \u0926\u093f\u092f\u093e \u091c\u093e\u0924\u093e \u0939\u0948 \u091c\u092c\u0915\u093f \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f \u0915\u0930\u0940 \u0915\u094b \u092a\u094d\u0930\u093e\u0907\u0935\u0947\u091f [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":48262,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[254],"tags":[5985],"yst_prominent_words":[],"class_list":["post-48257","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-tech","tag-5985"],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/posts\/48257","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/comments?post=48257"}],"version-history":[{"count":0,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/posts\/48257\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/media\/48262"}],"wp:attachment":[{"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/media?parent=48257"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/categories?post=48257"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/tags?post=48257"},{"taxonomy":"yst_prominent_words","embeddable":true,"href":"https:\/\/hindi.theindianwire.com\/wp-json\/wp\/v2\/yst_prominent_words?post=48257"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}