{"id":108,"date":"2018-07-11T11:18:56","date_gmt":"2018-07-11T11:18:56","guid":{"rendered":"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/?post_type=chapter&#038;p=108"},"modified":"2019-05-13T12:11:11","modified_gmt":"2019-05-13T12:11:11","slug":"public-key-algorithm-part-2","status":"publish","type":"chapter","link":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/chapter\/public-key-algorithm-part-2\/","title":{"rendered":"Public key Algorithm Part 2"},"content":{"raw":"\r\n<div>\r\n\r\n<strong>RSA algorithm:<\/strong>\r\n\r\n&nbsp;\r\n\r\n1.\u00a0\u00a0\u00a0\u00a0\u00a0 p,q two prim numbers\r\n\r\n2.\u00a0\u00a0\u00a0\u00a0\u00a0 n=pq\r\n\r\n3.\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Encryption key e, with GCD(\u0424(n),e) =1; 1&lt;e&lt; \u0424(n), \u0424(n) is called totient function.\r\n\r\n4.\u00a0\u00a0\u00a0\u00a0\u00a0 d=e-1 (mod \u0424(n))\r\n\r\n5.\u00a0\u00a0\u00a0\u00a0\u00a0 C=Me mod n, M is the message to be transmitted called plaintext. C is the ciphertext. M&lt;n\r\n\r\n6.\u00a0\u00a0\u00a0\u00a0\u00a0 M= Cd mod n\r\n\r\n&nbsp;\r\n\r\nPrivate key consist of [d,n] and public key consist of [e,n]\r\n\r\n&nbsp;\r\n\r\n<strong>Example:<\/strong>\r\n\r\n&nbsp;\r\n\r\n1.\u00a0\u00a0\u00a0\u00a0\u00a0 Select two primes, p=17 and q=11\r\n\r\n2.\u00a0\u00a0\u00a0\u00a0\u00a0 Calculate n=pq=17x11=187\r\n\r\n3.\u00a0\u00a0\u00a0\u00a0\u00a0 Calculate \u0424(n) = (p-1)(q-1) = 16x10=160\r\n\r\n4.\u00a0\u00a0\u00a0\u00a0\u00a0 Select e such that e is relatively prime to \u0424(n)=160 and less than \u0424(n). Suppose e=7\r\n\r\n5.\u00a0\u00a0\u00a0\u00a0\u00a0 Determined such that de\u22611 ( mod 160) and d&lt;160. d=23 because\r\n\r\n23x7=161=(1x160)+1;\r\n\r\nUse extended Euclid\u2019s algorithm to calculate d.\r\n\r\nPU=[7,187]\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PR=[23,187]\r\n\r\n&nbsp;\r\n\r\n<strong>M=88 C=?<\/strong>\r\n\r\n&nbsp;\r\n\r\nC=887 mod 187\r\n\r\n&nbsp;\r\n\r\n<strong>Exponentiation in modular arithmetic:<\/strong>\r\n\r\n<\/div>\r\n<ul>\r\n \t<li>\u00a8 a16 =axaxaxaxaxaxaxaxaxaxaxaxaxaxaxa<\/li>\r\n \t<li>\u00a8 a16 can be achieved by repeatedly squaring each partial result(a2,a4,a8,a16)<\/li>\r\n \t<li>\u00a8 To calculate a11 = (a) (a2)(a8). Calculate a mod n,a2 mod n,a4 mod n,a8 mod n. Then calculate [(a mod n)x(a2 mod n)x(a8 mod n)] mod n.<\/li>\r\n<\/ul>\r\n<strong>For a<\/strong><strong>b<\/strong><strong> mod n \u2013 a,b,n positive integers.<\/strong>\r\n<ul>\r\n \t<li>\u00a8 b expressed as binary number bkbk-1\u2026b0<\/li>\r\n<\/ul>\r\n<img class=\"size-full wp-image-109 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64.png\" alt=\"\" width=\"856\" height=\"362\" \/>\r\n\r\n<strong>Algorithm computing a<\/strong><strong>b<\/strong><strong> mod n. b is expressed as b<\/strong><strong>k<\/strong><strong>b<\/strong><strong>k-1<\/strong><strong>..b<\/strong><strong>0<\/strong>\r\n<ul>\r\n \t<li>\u00a8 C\u2190 0, f \u2190 1<\/li>\r\n \t<li>\u00a8 For i \u2190 k downto 0 do c \u2190 2xc<\/li>\r\n<\/ul>\r\nf \u2190 (fxf) mod n\r\n\r\nif bi = 1\r\n\r\nthen c \u2190 c+1\r\n\r\nf \u2190 (fxa) mod n\r\n\r\n<img class=\"size-full wp-image-110 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65.png\" alt=\"\" width=\"1061\" height=\"453\" \/>\r\n<div>\r\n\r\n<strong>Encryption \u2013 Decryption through RSA:<\/strong>\r\n\r\n&nbsp;\r\n\r\nC=887 mod 187\r\n\r\nC=11\r\n\r\nFor decryption, M=1123 mod 187 = 88\r\n\r\n&nbsp;\r\n\r\n<strong>The security of RSA:<\/strong>\r\n\r\n&nbsp;\r\n\r\n\u00a8\u00a0 Brute force \u2013 trying all possible keys\r\n\r\n\u00a8\u00a0\u00a0 Mathematical attack \u2013 factoring the product of two primes.\r\n\r\n\u00a8\u00a0\u00a0 Timing attacks \u2013 depends on running time of decryption algorithm.\r\n\r\n\u00a8\u00a0\u00a0 Hardware fault based attack \u2013 hardware fault in processor.\r\n\r\n\u00a8\u00a0\u00a0 Chosen ciphertext attack.\r\n\r\n&nbsp;\r\n\r\n<strong>Distribution of public keys:<\/strong>\r\n\r\n&nbsp;\r\n\r\n\u00a8\u00a0 Public announcement\r\n\r\n\u00a8\u00a0\u00a0 Publicly available directory\r\n\r\n\u00a8\u00a0\u00a0 Public key authority\r\n\r\n\u00a8\u00a0\u00a0 Public key certificates\r\n\r\n<\/div>\r\n&nbsp;\r\n\r\n<strong>Distribution of public keys - Public announcement<\/strong>\r\n\r\n<img class=\"size-full wp-image-111 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66.png\" alt=\"\" width=\"554\" height=\"767\" \/>\r\n\r\n<img class=\"size-full wp-image-112 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67.png\" alt=\"\" width=\"815\" height=\"791\" \/>\r\n\r\n<img class=\"size-full wp-image-113 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68.png\" alt=\"\" width=\"510\" height=\"707\" \/>\r\n\r\n\r\n<strong>Suggested Reading:<\/strong>\r\n\r\n&nbsp;\r\n<ol>\r\n \t<li>Cryptography and Network Security Principles and Practice by William Stallings, sixth Edition, PEARSON.<\/li>\r\n \t<li>Security in Computing by Charles Pfleeger &amp; Shari Lawrence Pfleeger, fourth Edition, PEARSON.<\/li>\r\n \t<li>Network Security by Charlie Kaufman, Radia Perlman, Mike Speciner, second Edition, PHI.<\/li>\r\n \t<li>The Complete Reference \u2013 Network Security by Roberta Bragg, Mark Rhodes-Ousley &amp; Keith Strassberg, Tata McGraw Hill<\/li>\r\n \t<li>Network Security Bible by Eric Cole, Ronald Krutz, James Conley, Wiley<\/li>\r\n \t<li>Hacking 6 Exposed by Stuart McClure, Joel Scambray &amp; George Kurtz , Tata McGraw Hill .<\/li>\r\n \t<li><a href=\"http:\/\/www.snort.org\/\">www.snort.org<\/a><\/li>\r\n \t<li><a href=\"https:\/\/nmap.org\/\">https:\/\/nmap.org<\/a><\/li>\r\n<\/ol>","rendered":"<div>\n<p><strong>RSA algorithm:<\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>1.\u00a0\u00a0\u00a0\u00a0\u00a0 p,q two prim numbers<\/p>\n<p>2.\u00a0\u00a0\u00a0\u00a0\u00a0 n=pq<\/p>\n<p>3.\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Encryption key e, with GCD(\u0424(n),e) =1; 1&lt;e&lt; \u0424(n), \u0424(n) is called totient function.<\/p>\n<p>4.\u00a0\u00a0\u00a0\u00a0\u00a0 d=e-1 (mod \u0424(n))<\/p>\n<p>5.\u00a0\u00a0\u00a0\u00a0\u00a0 C=Me mod n, M is the message to be transmitted called plaintext. C is the ciphertext. M&lt;n<\/p>\n<p>6.\u00a0\u00a0\u00a0\u00a0\u00a0 M= Cd mod n<\/p>\n<p>&nbsp;<\/p>\n<p>Private key consist of [d,n] and public key consist of [e,n]<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Example:<\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>1.\u00a0\u00a0\u00a0\u00a0\u00a0 Select two primes, p=17 and q=11<\/p>\n<p>2.\u00a0\u00a0\u00a0\u00a0\u00a0 Calculate n=pq=17&#215;11=187<\/p>\n<p>3.\u00a0\u00a0\u00a0\u00a0\u00a0 Calculate \u0424(n) = (p-1)(q-1) = 16&#215;10=160<\/p>\n<p>4.\u00a0\u00a0\u00a0\u00a0\u00a0 Select e such that e is relatively prime to \u0424(n)=160 and less than \u0424(n). Suppose e=7<\/p>\n<p>5.\u00a0\u00a0\u00a0\u00a0\u00a0 Determined such that de\u22611 ( mod 160) and d&lt;160. d=23 because<\/p>\n<p>23&#215;7=161=(1&#215;160)+1;<\/p>\n<p>Use extended Euclid\u2019s algorithm to calculate d.<\/p>\n<p>PU=[7,187]\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PR=[23,187]<\/p>\n<p>&nbsp;<\/p>\n<p><strong>M=88 C=?<\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>C=887 mod 187<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Exponentiation in modular arithmetic:<\/strong><\/p>\n<\/div>\n<ul>\n<li>\u00a8 a16 =axaxaxaxaxaxaxaxaxaxaxaxaxaxaxa<\/li>\n<li>\u00a8 a16 can be achieved by repeatedly squaring each partial result(a2,a4,a8,a16)<\/li>\n<li>\u00a8 To calculate a11 = (a) (a2)(a8). Calculate a mod n,a2 mod n,a4 mod n,a8 mod n. Then calculate [(a mod n)x(a2 mod n)x(a8 mod n)] mod n.<\/li>\n<\/ul>\n<p><strong>For a<\/strong><strong>b<\/strong><strong> mod n \u2013 a,b,n positive integers.<\/strong><\/p>\n<ul>\n<li>\u00a8 b expressed as binary number bkbk-1\u2026b0<\/li>\n<\/ul>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-109 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64.png\" alt=\"\" width=\"856\" height=\"362\" srcset=\"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64.png 856w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64-300x127.png 300w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64-768x325.png 768w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64-65x27.png 65w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64-225x95.png 225w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-64-350x148.png 350w\" sizes=\"auto, (max-width: 856px) 100vw, 856px\" \/><\/p>\n<p><strong>Algorithm computing a<\/strong><strong>b<\/strong><strong> mod n. b is expressed as b<\/strong><strong>k<\/strong><strong>b<\/strong><strong>k-1<\/strong><strong>..b<\/strong><strong>0<\/strong><\/p>\n<ul>\n<li>\u00a8 C\u2190 0, f \u2190 1<\/li>\n<li>\u00a8 For i \u2190 k downto 0 do c \u2190 2xc<\/li>\n<\/ul>\n<p>f \u2190 (fxf) mod n<\/p>\n<p>if bi = 1<\/p>\n<p>then c \u2190 c+1<\/p>\n<p>f \u2190 (fxa) mod n<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-110 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65.png\" alt=\"\" width=\"1061\" height=\"453\" srcset=\"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65.png 1061w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65-300x128.png 300w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65-768x328.png 768w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65-1024x437.png 1024w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65-65x28.png 65w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65-225x96.png 225w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-65-350x149.png 350w\" sizes=\"auto, (max-width: 1061px) 100vw, 1061px\" \/><\/p>\n<div>\n<p><strong>Encryption \u2013 Decryption through RSA:<\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>C=887 mod 187<\/p>\n<p>C=11<\/p>\n<p>For decryption, M=1123 mod 187 = 88<\/p>\n<p>&nbsp;<\/p>\n<p><strong>The security of RSA:<\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>\u00a8\u00a0 Brute force \u2013 trying all possible keys<\/p>\n<p>\u00a8\u00a0\u00a0 Mathematical attack \u2013 factoring the product of two primes.<\/p>\n<p>\u00a8\u00a0\u00a0 Timing attacks \u2013 depends on running time of decryption algorithm.<\/p>\n<p>\u00a8\u00a0\u00a0 Hardware fault based attack \u2013 hardware fault in processor.<\/p>\n<p>\u00a8\u00a0\u00a0 Chosen ciphertext attack.<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Distribution of public keys:<\/strong><\/p>\n<p>&nbsp;<\/p>\n<p>\u00a8\u00a0 Public announcement<\/p>\n<p>\u00a8\u00a0\u00a0 Publicly available directory<\/p>\n<p>\u00a8\u00a0\u00a0 Public key authority<\/p>\n<p>\u00a8\u00a0\u00a0 Public key certificates<\/p>\n<\/div>\n<p>&nbsp;<\/p>\n<p><strong>Distribution of public keys &#8211; Public announcement<\/strong><\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-111 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66.png\" alt=\"\" width=\"554\" height=\"767\" srcset=\"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66.png 554w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66-217x300.png 217w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66-65x90.png 65w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66-225x312.png 225w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-66-350x485.png 350w\" sizes=\"auto, (max-width: 554px) 100vw, 554px\" \/><\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-112 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67.png\" alt=\"\" width=\"815\" height=\"791\" srcset=\"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67.png 815w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67-300x291.png 300w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67-768x745.png 768w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67-65x63.png 65w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67-225x218.png 225w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-67-350x340.png 350w\" sizes=\"auto, (max-width: 815px) 100vw, 815px\" \/><\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-113 aligncenter\" src=\"http:\/\/itp4.epgpbooks.inflibnet.ac.in\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68.png\" alt=\"\" width=\"510\" height=\"707\" srcset=\"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68.png 510w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68-216x300.png 216w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68-65x90.png 65w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68-225x312.png 225w, https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-content\/uploads\/sites\/25\/2018\/07\/Untitled-68-350x485.png 350w\" sizes=\"auto, (max-width: 510px) 100vw, 510px\" \/><\/p>\n<p><strong>Suggested Reading:<\/strong><\/p>\n<p>&nbsp;<\/p>\n<ol>\n<li>Cryptography and Network Security Principles and Practice by William Stallings, sixth Edition, PEARSON.<\/li>\n<li>Security in Computing by Charles Pfleeger &amp; Shari Lawrence Pfleeger, fourth Edition, PEARSON.<\/li>\n<li>Network Security by Charlie Kaufman, Radia Perlman, Mike Speciner, second Edition, PHI.<\/li>\n<li>The Complete Reference \u2013 Network Security by Roberta Bragg, Mark Rhodes-Ousley &amp; Keith Strassberg, Tata McGraw Hill<\/li>\n<li>Network Security Bible by Eric Cole, Ronald Krutz, James Conley, Wiley<\/li>\n<li>Hacking 6 Exposed by Stuart McClure, Joel Scambray &amp; George Kurtz , Tata McGraw Hill .<\/li>\n<li><a href=\"http:\/\/www.snort.org\/\">www.snort.org<\/a><\/li>\n<li><a href=\"https:\/\/nmap.org\/\">https:\/\/nmap.org<\/a><\/li>\n<\/ol>\n","protected":false},"author":4,"menu_order":10,"template":"","meta":{"pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":["miss-hiteishi-diwanji"],"pb_section_license":""},"chapter-type":[],"contributor":[58],"license":[],"class_list":["post-108","chapter","type-chapter","status-publish","hentry","contributor-miss-hiteishi-diwanji"],"part":3,"_links":{"self":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/chapters\/108","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/wp\/v2\/users\/4"}],"version-history":[{"count":7,"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/chapters\/108\/revisions"}],"predecessor-version":[{"id":442,"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/chapters\/108\/revisions\/442"}],"part":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/parts\/3"}],"metadata":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/chapters\/108\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/wp\/v2\/media?parent=108"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/pressbooks\/v2\/chapter-type?post=108"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/wp\/v2\/contributor?post=108"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/itp4\/wp-json\/wp\/v2\/license?post=108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}