{"id":1031,"date":"2023-09-10T17:03:30","date_gmt":"2023-09-10T08:03:30","guid":{"rendered":"http:\/\/www.charleskwon.com\/?p=1031"},"modified":"2023-09-10T17:06:05","modified_gmt":"2023-09-10T08:06:05","slug":"shors-algorithm-with-harbour","status":"publish","type":"post","link":"https:\/\/www.charleskwon.com\/?p=1031","title":{"rendered":"Shor’s algorithm with harbour"},"content":{"rendered":"\n

The fields of quantum computing and artificial intelligence are developing every day without any special mention. In the future, even basic functional programming will be automated, which means that some “arrogant programmers” who rely only on functional coding will have no place.<\/p>\n\n\n\n

I believe that true computer science should be fundamentally rooted in philosophy – if you don’t love people and the discipline, any academic pursuit is meaningless.<\/p>\n\n\n\n

On the other hand, in the open source community, we see individuals hiding their code and rudely demanding other people’s code. It’s frustrating to see people who hide their code acting like schoolyard bullies, and I don’t want to waste my time on such low-level bullying.<\/p>\n\n\n\n

With the advent of quantum computing, traditional naive encryption will be broken. How? Because of Shor’s algorithm, which is designed to factorize numbers. Here’s how it’s implemented in harbor code:<\/p>\n\n\n\n

<\/div>\n\n\n\n

Shor’s algorithm<\/h2>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
\/*<\/span><\/span>\n  Shor's algorithm<\/span><\/span>\n  c)copyright Charles KWON ( charleskwonohjun@gmail.com )<\/span><\/span>\n<\/span>\n  The following code implements Shor's algorithm using a classical CPU. <\/span><\/span>\n  Once quantum computers are available, by adding QFT(Quantum Fourier Transform) to the code below, most RSA encryptions can be decrypted.<\/span><\/span>\n  <\/span><\/span>\n  https:\/\/en.wikipedia.org\/wiki\/Shor%27s_algorithm<\/span><\/span>\n  <\/span><\/span>\n*\/<\/span><\/span>\n<\/span>\nFUNCTION <\/span>Main<\/span>()<\/span><\/span>\n   LOCAL N :<\/span>=<\/span> <\/span>38<\/span> \/\/ For example purposes<\/span><\/span>\n   LOCAL aResult<\/span><\/span>\n<\/span>\n   aResult :<\/span>=<\/span> <\/span>factorizeByShor<\/span>(<\/span>N<\/span>)<\/span><\/span>\n<\/span>\n   <\/span>?<\/span> <\/span>"<\/span>Factor 1:<\/span>"<\/span>,<\/span> aResult<\/span>[<\/span>1<\/span>]<\/span><\/span>\n   <\/span>?<\/span> <\/span>"<\/span>Factor 2:<\/span>"<\/span>,<\/span> aResult<\/span>[<\/span>2<\/span>]<\/span><\/span>\n<\/span>\nRETURN NIL<\/span><\/span>\n<\/span>\nFUNCTION <\/span>mod_pow<\/span>(<\/span>a<\/span>,<\/span> x<\/span>,<\/span> N<\/span>)<\/span><\/span>\n   LOCAL y <\/span>:=<\/span> <\/span>1<\/span><\/span>\n<\/span>\n   WHILE x <\/span>><\/span> <\/span>0<\/span><\/span>\n      IF <\/span>BitAnd<\/span>(<\/span>x<\/span>,<\/span> <\/span>1<\/span>)<\/span> <\/span><><\/span> <\/span>0<\/span><\/span>\n         y <\/span>:=<\/span> y <\/span>*<\/span> a <\/span>%<\/span> N<\/span><\/span>\n      ENDIF<\/span><\/span>\n<\/span>\n      x :<\/span>=<\/span> <\/span>ShiftRight<\/span>(<\/span>x<\/span>,<\/span> <\/span>1<\/span>)<\/span><\/span>\n      a :<\/span>=<\/span> a <\/span>*<\/span> a <\/span>%<\/span> N<\/span><\/span>\n   ENDDO<\/span><\/span>\n<\/span>\nRETURN y<\/span><\/span>\n<\/span>\nFUNCTION <\/span>findPeriodByModPow<\/span>(<\/span>N<\/span>,<\/span> a<\/span>)<\/span><\/span>\n   LOCAL x<\/span><\/span>\n<\/span>\n   FOR x :<\/span>=<\/span> <\/span>1<\/span> TO N <\/span>-<\/span> <\/span>1<\/span><\/span>\n      <\/span>IF<\/span> <\/span>(<\/span>mod_pow<\/span>(<\/span>a<\/span>,<\/span> x<\/span>,<\/span> N<\/span>)<\/span> <\/span>==<\/span> <\/span>1<\/span>)<\/span><\/span>\n         RETURN x<\/span><\/span>\n      ENDIF<\/span><\/span>\n   NEXT<\/span><\/span>\n<\/span>\nRETURN <\/span>-<\/span>1<\/span><\/span>\n<\/span>\nFUNCTION <\/span>factorizeByShor<\/span>(<\/span>N<\/span>)<\/span><\/span>\n   LOCAL a<\/span>,<\/span> gcd<\/span>,<\/span> r<\/span>,<\/span> gcd1<\/span>,<\/span> gcd2<\/span><\/span>\n<\/span>\n   IF <\/span>mod<\/span>(<\/span>N<\/span>,<\/span> <\/span>2<\/span>)<\/span> <\/span>==<\/span> <\/span>0<\/span>                         \/\/ speed optimize ,  CharlesKWON<\/span><\/span>\n      RETURN <\/span>{<\/span> <\/span>2<\/span>,<\/span> N <\/span>\/<\/span> <\/span>2<\/span>}<\/span><\/span>\n   ENDIF<\/span><\/span>\n<\/span>\n   WHILE .T.<\/span><\/span>\n      a :<\/span>=<\/span> <\/span>RandomRange<\/span>(<\/span>2<\/span>,<\/span> N<\/span>)<\/span><\/span>\n      gcd :<\/span>=<\/span> <\/span>GCD<\/span>(<\/span>N<\/span>,<\/span> a<\/span>)<\/span><\/span>\n<\/span>\n      <\/span>IF<\/span> <\/span>(<\/span>gcd <\/span>!=<\/span> <\/span>1<\/span>)<\/span><\/span>\n         RETURN <\/span>{<\/span>gcd<\/span>,<\/span> N <\/span>\/<\/span> gcd<\/span>}<\/span><\/span>\n      ENDIF<\/span><\/span>\n<\/span>\n      r :<\/span>=<\/span> <\/span>findPeriodByModPow<\/span>(<\/span>N<\/span>,<\/span> a<\/span>)<\/span><\/span>\n<\/span>\n      <\/span>IF<\/span> <\/span>(<\/span>r <\/span>%<\/span> <\/span>2<\/span> <\/span>!=<\/span> <\/span>0<\/span>)<\/span><\/span>\n         LOOP<\/span><\/span>\n      ENDIF<\/span><\/span>\n<\/span>\n      gcd1 :<\/span>=<\/span> <\/span>GCD<\/span>(<\/span>N<\/span>,<\/span> <\/span>Pow<\/span>(<\/span>a<\/span>,<\/span> r <\/span>\/<\/span> <\/span>2<\/span>)<\/span> <\/span>+<\/span> <\/span>1<\/span>)<\/span><\/span>\n      gcd2 :<\/span>=<\/span> <\/span>GCD<\/span>(<\/span>N<\/span>,<\/span> <\/span>Pow<\/span>(<\/span>a<\/span>,<\/span> r <\/span>\/<\/span> <\/span>2<\/span>)<\/span> <\/span>-<\/span> <\/span>1<\/span>)<\/span><\/span>\n<\/span>\n      <\/span>IF<\/span> <\/span>(<\/span>gcd1 <\/span>==<\/span> <\/span>1<\/span> .OR. gcd2 <\/span>==<\/span> <\/span>1<\/span>)<\/span><\/span>\n         LOOP<\/span><\/span>\n      ENDIF<\/span><\/span>\n<\/span>\n      RETURN <\/span>{<\/span>gcd1<\/span>,<\/span> gcd2<\/span>}<\/span><\/span>\n   ENDDO<\/span><\/span>\n<\/span>\nRETURN NIL<\/span><\/span>\n<\/span>\n\/*<\/span><\/span>\n   Greatest Common Divisor (GCD)<\/span><\/span>\n*\/<\/span><\/span>\nFUNCTION <\/span>GCD<\/span>(<\/span>a<\/span>,<\/span> b<\/span>)<\/span><\/span>\n   LOCAL temp<\/span><\/span>\n<\/span>\n   WHILE b <\/span>!=<\/span> <\/span>0<\/span><\/span>\n      temp :<\/span>=<\/span> a<\/span><\/span>\n      a :<\/span>=<\/span> b<\/span><\/span>\n      b :<\/span>=<\/span> temp <\/span>%<\/span> b<\/span><\/span>\n   ENDDO<\/span><\/span>\n<\/span>\nRETURN a<\/span><\/span>\n<\/span>\nFUNCTION <\/span>RandomRange<\/span>(<\/span>nLower<\/span>,<\/span> nUpper<\/span>)<\/span><\/span>\nRETURN nLower <\/span>+<\/span> <\/span>INT<\/span>(<\/span>RAND<\/span>()<\/span> <\/span>*<\/span> <\/span>(<\/span>nUpper <\/span>-<\/span> nLower <\/span>+<\/span> <\/span>1<\/span>))<\/span><\/span>\n<\/span>\nFUNCTION <\/span>ShiftRight<\/span>(<\/span>nValue<\/span>,<\/span> nShift<\/span>)<\/span><\/span>\nRETURN nValue <\/span>\/<\/span> <\/span>(<\/span>2<\/span> <\/span>^<\/span> nShift<\/span>)<\/span><\/span>\n<\/span>\nFUNCTION <\/span>BitAnd<\/span>(<\/span>a<\/span>,<\/span> b<\/span>)<\/span><\/span>\n   LOCAL nRet :<\/span>=<\/span> <\/span>0<\/span><\/span>\n<\/span>\n   IF a <\/span><><\/span> <\/span>0<\/span> .AND. b <\/span><><\/span> <\/span>0<\/span><\/span>\n      nRet :<\/span>=<\/span> <\/span>1<\/span><\/span>\n   ENDIF<\/span><\/span>\n<\/span>\nRETURN nRet<\/span><\/span>\n<\/span><\/code><\/pre><\/div>\n\n\n\n

I’ve implemented it using a traditional CPU-based algorithm, as shown in the figure above. Pretty easy to understand, right?<\/strong><\/p>\n\n\n\n
Add quantum code to the mix and all existing RSA encryption would be broken in a heartbeat. Once again, true computer science must be grounded in the philosophy that underlies the science.<\/p>\n\n\n\n
Simply knowing how to write a few lines of basic code and being satisfied with the status quo will not save you. With the advent of AI and quantum computing, these school bully types will become obsolete.<\/p>\n\n\n\n
Good luck.<\/strong><\/p>\n\n\n\n
<\/p>\n\n\n\n
\"\"<\/figure>\n","protected":false},"excerpt":{"rendered":"
The fields of quantum computing and artificial intelligence are developing every day without any special mention. In the…<\/p>\n","protected":false},"author":1,"featured_media":1032,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_blocks_custom_css":"","_kad_blocks_head_custom_js":"","_kad_blocks_body_custom_js":"","_kad_blocks_footer_custom_js":"","_kadence_starter_templates_imported_post":true,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[4],"tags":[],"class_list":["post-1031","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-technique-productivity"],"taxonomy_info":{"category":[{"value":4,"label":"Technique"}]},"featured_image_src_large":["https:\/\/www.charleskwon.com\/wp-content\/uploads\/2023\/09\/image-1.png",1024,1024,false],"author_info":{"display_name":"CharlesKWON","author_link":"https:\/\/www.charleskwon.com\/?author=1"},"comment_info":0,"category_info":[{"term_id":4,"name":"Technique","slug":"technique-productivity","term_group":0,"term_taxonomy_id":4,"taxonomy":"category","description":"","parent":0,"count":8,"filter":"raw","cat_ID":4,"category_count":8,"category_description":"","cat_name":"Technique","category_nicename":"technique-productivity","category_parent":0}],"tag_info":false,"_links":{"self":[{"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/posts\/1031","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1031"}],"version-history":[{"count":3,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/posts\/1031\/revisions"}],"predecessor-version":[{"id":1036,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/posts\/1031\/revisions\/1036"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=\/wp\/v2\/media\/1032"}],"wp:attachment":[{"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1031"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1031"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.charleskwon.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1031"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}