{"id":225657,"date":"2021-04-13T15:00:34","date_gmt":"2021-04-13T12:00:34","guid":{"rendered":"https:\/\/en.buradabiliyorum.com\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/"},"modified":"2021-04-13T15:00:34","modified_gmt":"2021-04-13T12:00:34","slug":"has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it","status":"publish","type":"post","link":"https:\/\/buradabiliyorum.com\/en\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/","title":{"rendered":"#Has the RSA Just Been Destroyed by a Retired German Mathematician? \u2013 CloudSavvy IT"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_85 counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<label for=\"ez-toc-cssicon-toggle-item-6a34d442bebba\" class=\"ez-toc-cssicon-toggle-label\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #dd3333;color:#dd3333\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #dd3333;color:#dd3333\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-6a34d442bebba\" checked aria-label=\"Toggle\" \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/buradabiliyorum.com\/en\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/#What_Is_RSA_Encryption\" >What Is RSA Encryption?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/buradabiliyorum.com\/en\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/#Threats_to_RSA_Cryptography\" >Threats to RSA Cryptography<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/buradabiliyorum.com\/en\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/#What_Is_the_New_Threat\" >What Is the New Threat?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/buradabiliyorum.com\/en\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/#An_Analysis_of_the_Threat\" >An Analysis of the Threat<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/buradabiliyorum.com\/en\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician-cloudsavvy-it\/#We_Can_All_Breathe_Again\" >We Can All Breathe Again<\/a><\/li><\/ul><\/nav><\/div>\n<p><strong>&#8220;#Has the RSA Just Been Destroyed by a Retired German Mathematician? \u2013 CloudSavvy IT&#8221;<\/strong><\/p>\n<div id=\"article-content-area\">\n<figure style=\"width: 650px\" class=\"wp-caption alignnone\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-10621 size-full\" data-pagespeed-lazy-src=\"https:\/\/www.cloudsavvyit.com\/p\/uploads\/2021\/04\/a2a0d88e.png?width=1200&amp;trim=1,1&amp;bg-color=000&amp;pad=1,1\" alt=\"\" width=\"650\" height=\"325\" src=\"https:\/\/www.shutterstock.com\/image-photo\/oldfashioned-rusty-iron-key-on-sheet-30891370\" data-credittext=\"Shutterstock\" onload=\"pagespeed.lazyLoadImages.loadIfVisibleAndMaybeBeacon(this);\" onerror=\"this.onerror=null;pagespeed.lazyLoadImages.loadIfVisibleAndMaybeBeacon(this);\"\/><figcaption class=\"wp-caption-text\"><span class=\"imagecredit\"><a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.shutterstock.com\/image-photo\/oldfashioned-rusty-iron-key-on-sheet-30891370\">Shutterstock<\/a><\/span><\/figcaption><\/figure>\n<p>A huge part of the digital world relies on RSA encryption for privacy and security. A recent mathematical paper that \u201cdestroys the RSA cryptosystem\u201d gave cryptographers palpitations. Are they right to worry?<\/p>\n<h2 id=\"what-is-rsa-encryption\"><span class=\"ez-toc-section\" id=\"What_Is_RSA_Encryption\"><\/span>What Is RSA Encryption?<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>The <a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/RSA_(cryptosystem)\">Rivest-Shamir-Adleman<\/a> (RSA) cryptosystem solved the problem of how to encrypt data so that it could only be decrypted by the intended recipient. In 1977, the co-creators\u2014<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Ron_Rivest\">Ron Rivest<\/a>,\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Adi_Shamir\">Adi Shamir<\/a>, and\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Leonard_Adleman\">Leonard Adleman<\/a>\u2014proposed\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"http:\/\/people.csail.mit.edu\/rivest\/Rsapaper.pdf\">an elegant solution<\/a>\u00a0based on a new way to use encryption keys. Simply put, encryption keys are very large values used in the mathematical processes that are <a href=\"https:\/\/buradabiliyorum.com\/en\/category\/download-scripts-themes-apps\/\" data-internallinksmanager029f6b8e52c=\"9\" title=\"Download Scripts &amp; Themes &amp; Apps\" target=\"_blank\" rel=\"noopener\">app<\/a>lied to the data to encrypt it. The breakthrough that RSA brought to the world of cryptography was the use of\u00a0<em>private<\/em>\u00a0and\u00a0<em>public<\/em>\u00a0keys.<\/p>\n<p>We should also mention\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Clifford_Cocks\">Clifford Cocks<\/a>, the chief mathematician at the U.K.\u2019s\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.gchq.gov.uk\/\">Government Communication Headquarters<\/a>\u00a0(GCHQ) who applied public and private key encryption\/decryption to cryptography in 1973. The information was classified and remained secret. It was only declassified in 1997. Great minds obviously do think alike.<\/p>\n<p>The public key\/private key sequence is to obtain the intended recipient\u2019s public key and use it in the encryption process along with your private key. The recipient can then decrypt the data using their private key and your public key. Public keys can be safely made public, and private keys are kept securely private. And because the recipient doesn\u2019t need to be a human, any system, service, or device that makes its public key known in a certified, authenticated fashion can use RSA encryption. This allows system-to-system communications to be encrypted.<\/p>\n<p>A\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Public_key_certificate\">public key certificate<\/a>\u00a0is used to certify the identity of the owner of the public key. Two common examples of public key certificates are\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Transport_Layer_Security#SSL_1.0,_2.0,_and_3.0\">Secure Socket Layer<\/a>\u00a0and\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Transport_Layer_Security#TLS_1.3\">Transport Layer Certificates<\/a>\u00a0(SSL\/TLS). Public keys can be transmitted between people who want to communicate, or they can be retrieved from key servers such as the\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/keys.openpgp.org\/\">OpenPGP key server<\/a>.<\/p>\n<p><a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Secure_Shell_Protocol\">Secure Shell<\/a>\u00a0(SSH),\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Pretty_Good_Privacy#OpenPGP\">OpenPGP<\/a>,\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/S\/MIME\">S\/MIME<\/a>, and SSL\/TSL all use RSA encryption, and all browsers use it. Some cryptocurrencies use it. Practically the whole of the e-commerce world depends on RSA in one way or another. Anything that threatens the integrity of the RSA cryptosystem needs to be looked at carefully.<\/p>\n<p><strong>RELATED:<\/strong> <a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.howtogeek.com\/706402\/how-to-use-openpgp-encryption-for-emails-in-thunderbird\/\"><strong><em>How to Use OpenPGP Encryption for Emails in Thunderbird<\/em><\/strong><\/a><\/p>\n<h2 id=\"threats-to-rsa-cryptography\"><span class=\"ez-toc-section\" id=\"Threats_to_RSA_Cryptography\"><\/span>Threats to RSA Cryptography<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>A central element of the encryption algorithms is\u00a0<em>irreversibility<\/em>. The mathematical transforms that are performed on the data must be irreversible for all practical purposes.<\/p>\n<p>The RSA scheme uses very large numbers that are the product of multiplying two large prime numbers together. Taking two prime numbers and multiplying them together is trivial and\u00a0<em>computationally cheap<\/em>. It doesn\u2019t take much processing power or time to perform that action. But being handed the resulting product and with no prior knowledge trying to work out\u2014via factoring\u2014which two prime numbers were used is\u00a0<em>computationally expensive<\/em>.<\/p>\n<p>Factoring gets much harder very quickly as the numbers become larger. It would take such a prohibitive time\u2014some estimates run to\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.quintessencelabs.com\/blog\/breaking-rsa-encryption-update-state-art\">trillions of years<\/a>\u2014to crack this type of encryption.\u00a0This provides a safe pseudo-irreversibility. It\u2019s not really irreversible, but it would take so long to do it, that it might as well be genuinely irreversible.<\/p>\n<p>The advent of\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Quantum_computing\">quantum computing<\/a>\u00a0brings a threat to this type of encryption. Quantum computers show promise to be able to do the integer factorization required to determine the two prime numbers in an extremely short time. It is predicted that a quantum computer running a derivative of\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Shor%27s_algorithm\">Shor\u2019s Algorithm<\/a>\u00a0would be able to find the prime numbers within acceptably short periods of time\u2014perhaps even within hours.<\/p>\n<p>It\u2019s expected\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.technologyreview.com\/2019\/05\/30\/65724\/how-a-quantum-computer-could-break-2048-bit-rsa-encryption-in-8-hours\/\">to take 25 years<\/a>\u00a0or more before a quantum computer capable of doing that exists. That might be fine for some information that is encrypted now\u2014the usefulness of the information might have expired by then. But some of what is being encrypted now will still need to be protected and private in 25 (or even more) years from now. For example, some government and security communications will still be sensitive even then.<\/p>\n<p>Errors in the implementation of the RSA have caused issues in the past. The theoretical RSA has to be rendered into a working software implementation before it can be useful\u2014and complex software will often contain bugs. There have been tweaks and replacements to the algorithms used in the RSA cryptosystem as flaws have been found in the implementations. Old versions have been deprecated and superseded by new versions.<\/p>\n<p>There have been claims that back doors have been introduced into the RSA algorithms because of coercion by, or cooperation with, national security agencies. These accusations have never been proven, but flaws that effectively provided back doors\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"http:\/\/rump2007.cr.yp.to\/15-shumow.pdf\">have been found<\/a>\u00a0and subsequently addressed.<\/p>\n<h2 id=\"what-is-the-new-threat\"><span class=\"ez-toc-section\" id=\"What_Is_the_New_Threat\"><\/span>What Is the New Threat?<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Professor\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Claus_P._Schnorr\">Claus Peter Schnorr<\/a>\u00a0is a retired mathematician and cryptographer. He was a professor at the Department of Mathematics and Computer <a href=\"https:\/\/buradabiliyorum.com\/en\/category\/sciencee\/\" data-internallinksmanager029f6b8e52c=\"5\" title=\"Science\" target=\"_blank\" rel=\"noopener\">Science<\/a> at\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.goethe-university-frankfurt.de\/en?locale=en\">Johann Wolfgang Goethe University<\/a>\u00a0in Frankfurt am Main.<\/p>\n<p>A preprint of a paper by Schnorr (<em>preprint<\/em>\u00a0means that it is in late development but not yet peer-reviewed) proposes a\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/eprint-bin\/getfile.pl?entry=2021\/232&amp;version=20210303:182120&amp;file=232.pdf\">new method of factoring prime integers<\/a>\u00a0on today\u2019s computing platforms at a greatly accelerated rate. The paper is titled \u201cFast Factoring Integers by SVP Algorithms.\u201d SVP stands for\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Lattice_problem#Shortest_vector_problem_(SVP)\">shortest vector problem<\/a>. The abstract ends with the provocative sentence \u201cThis destroys the RSA cryptosystem.\u201d<\/p>\n<p>By condensing a very complicated piece of work into a simple statement, what this propounds is an improvement by an order of magnitude in the speed of factoring. The speed gain would be achieved by using a refinement of some of Schnorr\u2019s earlier work. Obviously, a revolutionary reduction in factoring integers would have a significant impact on the RSA cryptosystem. That is, if the theoretical paper is factually correct and if a practical implementation can bear out the hypothesis.<\/p>\n<p>The paper promotes a factoring method using mathematical structures called\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Lattice_(group)\">lattices<\/a>. Professor Schnorr is a widely recognized expert in this field and its application to cryptography. The paper claims that the new technique is dramatically faster than the\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/General_number_field_sieve\">General Number Field Sieve<\/a>\u00a0(GNFS) algorithm, which is considered to be the fastest current technique for factoring large numbers.<\/p>\n<h2 id=\"an-analysis-of-the-threat\"><span class=\"ez-toc-section\" id=\"An_Analysis_of_the_Threat\"><\/span>An Analysis of the Threat<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Schorr\u2019s paper is theoretical in nature. There are no timings or results from implementations. The theoretical speed gains over the GNFS sound impressive on paper, but do the theory and mathematics withstand scrutiny by those who actually understand this at the level required to meaningfully comment on it?<\/p>\n<p>Dr.\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/homepages.cwi.nl\/~ducas\/\">L\u00e9o Ducas<\/a>\u00a0is a researcher in the\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/projects.cwi.nl\/crypto\/\">cryptography group<\/a>\u00a0at the\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.cwi.nl\/\">Centrum Wiskunde &amp; Informatica<\/a>\u00a0(CWI). The CWI is the national research institute for mathematics and computer science in the Netherlands. Ducas completed his Ph.D.\u00a0in 2013 on \u201cLattice Based Signatures: Attacks, Analysis and Optimization.\u201d He has worked with lattices throughout his career. He\u2019s also a cryptographer, so he is eminently capable of reviewing Schnorr\u2019s paper.<\/p>\n<p>Even better for our purposes, Dr.\u00a0L\u00e9o Ducas is a programmer. If you fancy a turn at Cryptris, his\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/cryptris.nl\/index_en.html\">asymmetric cryptography game<\/a>, go right ahead. His academic source code is scattered across\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/github.com\">GitHub<\/a>. Some of it sits in\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/github.com\/lducas\">his own repository,<\/a>\u00a0while much more resides in the repositories of other multi-author projects that he\u2019s worked on.<\/p>\n<p>He\u2019s performed a review and analysis of Schnorr\u2019s paper. He has also created an implementation of Schnorr\u2019s algorithms as a\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/www.sagemath.org\/\">SageMath<\/a>\u00a0script.\u00a0He\u2019s named it\u00a0<em><a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/github.com\/lducas\/SchnorrGate\">SchnorrGate<\/a><\/em>. Ducas also points to a discussion on the\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/crypto.stackexchange.com\/questions\/88582\/does-schnorrs-2021-factoring-method-show-that-the-rsa-cryptosystem-is-not-secur\/88601#88601\">cryptography StackExchange<\/a>. This examines a mistake in one of the formulas in the paper which, if used as printed, produces highly inaccurate results. With this formula corrected, Schnorr\u2019s factoring method does work, but at a much slower rate than he predicts.<\/p>\n<p>Ducas\u2019 findings from his SageMath tests corroborate this. They illustrate that Schnorr\u2019s factoring algorithms do work, but much more slowly than the best methods already available today.<\/p>\n<h2 role=\"heading\" aria-level=\"2\"><span class=\"ez-toc-section\" id=\"We_Can_All_Breathe_Again\"><\/span>We Can All Breathe Again<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>The RSA lives to encrypt another day. But what would have happened if the claims in the paper had turned out to be true? Well, chaos, initially, and then, the adoption of a new cryptosystem.<\/p>\n<p>Perhaps the era of\u00a0<a rel=\"nofollow noopener\" target=\"_blank\" href=\"https:\/\/en.wikipedia.org\/wiki\/Elliptic-curve_cryptography\">Elliptic-Curve Cryptography<\/a> (ECC) would have arrived.\n<\/div>\n<blockquote><p><strong><span style=\"color: #ff6600;\">If you liked the article, do not forget to share it with your friends. Follow us on\u00a0<span style=\"color: #ff0000;\"><a style=\"color: #ff0000;\" href=\"https:\/\/news.google.com\/publications\/CAAqBwgKMLG0nwswvr63Aw\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">Google News<\/a><\/span>\u00a0too, click on the star and choose us from your favorites.<\/span><\/strong><\/p><\/blockquote>\n<blockquote>\n<p style=\"text-align: center;\">For forums sites go to <span style=\"color: #ff9900;\"><a style=\"color: #ff9900;\" href=\"https:\/\/forum.buradabiliyorum.com\/\" target=\"_blank\" rel=\"noopener\">Forum.BuradaBiliyorum.Com<\/a><\/span><\/strong><\/p>\n<\/blockquote>\n<blockquote>\n<p style=\"text-align: center;\"><strong>If you want to read more like this article, you can visit our <span style=\"color: #ff9900;\"><a style=\"color: #ff9900;\" href=\"https:\/\/en.buradabiliyorum.com\/technology\/\" target=\"_blank\" rel=\"noopener\">Technology category.<\/a><\/span><\/strong><\/p>\n<\/blockquote>\n<p><span style=\"color: black;\"><a style=\"color: #ff9900;\" href=\"https:\/\/www.cloudsavvyit.com\/10543\/has-the-rsa-just-been-destroyed-by-a-retired-german-mathematician\/\" target=\"_blank\" rel=\"noopener\">Source<\/a><\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>&#8220;#Has the RSA Just Been Destroyed by a Retired German Mathematician? \u2013 CloudSavvy IT&#8221; Shutterstock A huge part of the digital world relies on RSA encryption for privacy and security. A recent mathematical paper that \u201cdestroys the RSA cryptosystem\u201d gave cryptographers palpitations. Are they right to worry? What Is RSA Encryption? The Rivest-Shamir-Adleman (RSA) cryptosystem&#8230;<\/p>\n","protected":false},"author":1,"featured_media":225658,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"fifu_image_url":"https:\/\/www.cloudsavvyit.com\/p\/uploads\/2021\/04\/a2a0d88e.png","fifu_image_alt":"","footnotes":""},"categories":[18],"tags":[],"class_list":["post-225657","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-technology"],"_links":{"self":[{"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/posts\/225657","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/comments?post=225657"}],"version-history":[{"count":0,"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/posts\/225657\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/media\/225658"}],"wp:attachment":[{"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/media?parent=225657"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/categories?post=225657"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/buradabiliyorum.com\/en\/wp-json\/wp\/v2\/tags?post=225657"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}