投稿時間:2022-07-06 08:33:56 RSSフィード2022-07-06 08:00 分まとめ(42件)

カテゴリー等	サイト名等	記事タイトル・トレンドワード等	リンクURL	頻出ワード・要約等/検索ボリューム	登録日
IT	気になる、記になる…	Twitter、Mac App Storeからも｢TweetDeck｣を削除	https://taisy0.com/2022/07/06/158802.html	macappstore	2022-07-05 22:39:31
IT	気になる、記になる…	M2搭載｢MacBook Air｣、やはり7月8日に予約受付開始で7月15日発売か − 人気YouTuberがスケジュールを誤って公開	https://taisy0.com/2022/07/06/158797.html	apple	2022-07-05 22:17:57
IT	InfoQ	VMware vSphere+ and vSAN+ Promise to Bring the Benefits of the Cloud to On-Premises Workloads	https://www.infoq.com/news/2022/07/vmware-vsphere-vsan/?utm_campaign=infoq_content&utm_source=infoq&utm_medium=feed&utm_term=global	VMware vSphere and vSAN Promise to Bring the Benefits of the Cloud to On Premises WorkloadsRecently announced VMware vSphere and vSAN integrate Kubernetes with VMware virtualization technology to help transform on premises workloads into SaaS enabled infrastructure and simplify its management and evolution says VMware By Sergio De Simone	2022-07-05 23:00:00
AWS	AWS Security Blog	2022 H1 IRAP report is now available on AWS Artifact	https://aws.amazon.com/blogs/security/2022-h1-irap-report-is-now-available-on-aws-artifact/	H IRAP report is now available on AWS ArtifactWe re excited to announce that a new Information Security Registered Assessors Program IRAP report is now available on AWS Artifact Amazon Web Services AWS successfully completed an IRAP assessment in May by an independent ASD Australian Signals Directorate certified IRAP assessor The new IRAP report includes an additional nine AWS services that are now …	2022-07-05 22:09:23
AWS	AWS Security Blog	2022 H1 IRAP report is now available on AWS Artifact	https://aws.amazon.com/blogs/security/2022-h1-irap-report-is-now-available-on-aws-artifact/	H IRAP report is now available on AWS ArtifactWe re excited to announce that a new Information Security Registered Assessors Program IRAP report is now available on AWS Artifact Amazon Web Services AWS successfully completed an IRAP assessment in May by an independent ASD Australian Signals Directorate certified IRAP assessor The new IRAP report includes an additional nine AWS services that are now …	2022-07-05 22:09:23
海外TECH	Ars Technica	YouTube flags horror video as “for kids,” won’t let creator change rating	https://arstechnica.com/?p=1864279	youtube	2022-07-05 22:14:14
海外TECH	DEV Community	Cryptography basics: breaking repeated-key XOR ciphertext	https://dev.to/wrongbyte/cryptography-basics-breaking-repeated-key-xor-ciphertext-1fm2	Cryptography basics breaking repeated key XOR ciphertextIn this post we are going to learn a bit of what is the XOR encryption algorithm and how to decipher it through Friedman Test using Hamming Distance and Frequency Analysis First of all what exactly is a XOR cipher If you ever studied bitwise operators you have already heard of exclusive or or simply XOR It takes two inputs and returns if these inputs are different But the interesting part is that this simple operation that happens in the bits level is very useful for composing cryptographic keys That s what we ll see in this post using a bit of Python and the problem presented in the th challenge of Cryptopals set How can we use XOR as a method of encryption In fact what is a cryptographic cipher To answer this question let s think in terms of functions Encrypting a message is taking its plaintext or more precisely its bytes and generating an appearing random output with the help of an encryption algorithm This algorithm defines the pattern we ll follow when replacing the original content with the encrypted one For example the Caesar cipher replaces a letter with its corresponding following letter such that ABC becomes BCD This pattern goes through the whole message But the Caesar cipher can skip more than one letter what matters here is the logic of substitution In this way the XOR cipher is very similar Bytes ASCII and single byte XORBefore introducing the encryption with a repeating cipher let s first understand how a single byte encryption would be done The encryption with a single byte XOR cipher is made when we use the XOR operation to change the value of each byte we make this operation in the whole text using a key that is the constant value which we are going to use to do this operation binary string b hello for byte in binary string print byte The outputs will be and It happens because each letter in a binary string can be represented by a binary number that XORed against the key here returns a different byte This number could be any value within the range Therefore here acts as our key we would need to know this value to perform the decryption of the message Using a XOR cipher is a symmetric encryption method what means that we need the same key both to encrypt and decrypt a message It happens because XOR is an involutory function it s its own inverse so to decrypt a message we would need to simply XOR its bytes against the key again So we already have a substitution cipher similar in terms of Caesar cipher but a bit more sophisticated Side note it turns out that not all XORed bytes will be printable since they can be outside the ASCII range In this case we can make a conversion to base for example to print them See in Portuguese Side note the article above can also be helpful to help you understand how things work with ASCII characters in byte level Repeating XOR cipherIt turns out that encrypting something with a single byte key would be a very weak encryption method To break it we would only need to know which key was used which could be achieved by bruteforcing all the possible values Then we could look at the outputs of these operations and choose the one that is more English like by assign scores to each output based on the most frequent letters across the English language PS remember this function we are going to see it later again Breaking a single byte XOR cipher we perform a XOR operation in the string using all possible values for the key The key used to generate the output closer to English is what we are searching for def assign score output string string score freq e t a o i n s h r d l u for letter in output string if letter in freq string score return string scoredef XOR decode bytes encoded array last score greatest score for n in range checks for every possible value for XOR key xord str byte n for byte in encoded array xord ascii join chr b for b in xord str last score assign score xord ascii if last score gt greatest score greatest score last score key n return keySo we can make it harder to break by simply creating a longer key with more bytes and that repeats itself across the text It would require us two steps to break first we would need to know the length of the key and then we would need to know the key itself which means testing each possible value for each one of the key s characters A bit more complicated right So let s understand how to encrypt a text using a XOR repeating key first Repeating key encryptioninput text b Burning em if you ain t quick and nimble nI go crazy when I hear a cymbal XOR key b ICE def XOR repeating encode input string bytes key bytes gt bytes xord output print input string for i in range len input string xord output append input string i key i len key return bytes xord output The logic here is pretty the same we used for the single byte key In short we perform a XOR operation against each of the characters of the key which is ICE here So B is XORed against I u against C and r against E and so forth until we reach the end of the text Getting the plaintext back is achieved through the same process But what if we wanted to recover the plaintext without knowing the key Here things start to get interesting Let s see how to break a repeated key XOR ciphertext The key s length Hamming distanceHow far is a from d You may say that they are a few letters apart in the alphabet But there s another interesting way to measure their distance how many different bits they have which is their Hamming distance So lowercase a is in the ASCII table and lowercase d is Their binary representations are and They have different bits so their hamming distance is You can measure this distance across phrases too the process is the same you only sum the result from each pair of characters What this measure has to do with the repeating XOR cipher The average Hamming distance between two bytes picked at random is around while that of any two lowercased ASCII alphabet whose values range from to is So it means that the hamming distance between the characters of a plaintext will be much lower than that from a bunch of random bytes and this information is very useful when we get to test the possible outputs for a variety of possible key lengths Let s understand it better def hamming distance string bytes string bytes gt int distance for byte byte in zip string string distance bin byte byte count return distanceChecking the different bits of two strings is basically the same as performing an XOR operation on them and counting the s so the function above does exactly this Alright We now have a way to score a string to know the distance between its bytes How can we use it now In this challenge the range of the size of possible keys is within the interval Therefore we will have to do the following steps Divide our text into different chunk sizes ranging from to On each iteration for each chunk size chosen we will check the hamming score between the chunks The length of chunks with the lower average hamming distance corresponds to the key s length This technique works because once we get the right size for the key the chunks will be just XORed plaintext Therefore their hamming distance will be way lower than if they were random bytes def find key length we are searching for the length that produces an output with the lowest hamming score min score len text for keysize in range chunks text start start keysize for start in range len text keysize subgroup chunks getting the average hamming distance per byte average score sum hamming distance a b for a b in combinations subgroup keysize if average score lt min score min score average score key length keysize return key lengthIn the code above the logic is as it follows Let s say that we are guessing that the key is characters long If we had the following text text YWJjZGVmZhpamtsbW We would divide it in several chunks with four letters each chunks YWJj ZGVm Zhp amts bW Now if we take the first four chunks we are able to measure the average hamming distance between them keysize here is equal to and subgroup is the first four chunks dividing the score by gives us the average diff between chunks dividing it by keysize gives us the average diff between each a b bytes for chunk chunkaverage score sum hamming distance a b for a b in combinations subgroup keysize The key itselfOnce we get the key s length things get easier In this particular challenge it turns out that the key is characters long Even though we know the length we still have characters to guess each one having possibilities How to do that Well the answer lies on matrices def find key key length find key length key blocks text start start key length for start in range len text key length transpose the D matrix key single XOR blocks list filter None i for i in zip longest key blocks for block in single XOR blocks key n XOR decode bytes block key append key n ascii key join chr c for c in key return ascii key encode If our key had exactly three characters say the key was RED then each first character of each chunk would be XORed against R the second against E and so on So if we joined each nth character of each chunk the result would be a list of characters encrypted with a single byte XOR cipher whose key is the nth character of our repeating key Oof that s too much Let s see it in detail The operation of creating an array joining every nth element of each chunk is basically transposing a matrix To finally discover the key then we just need to apply the function that finds the key for a single byte XOR ciphertext in each of the lines of our new generated matrix And now we have our deciphered plaintext You can see the full code for this post here	2022-07-05 22:30:42
海外TECH	CodeProject Latest Articles	Reading OPC DA data in PowerShell	https://www.codeproject.com/Articles/5336579/Reading-OPC-DA-data-in-PowerShell	powershell	2022-07-05 22:52:00
海外TECH	CodeProject Latest Articles	Img2Cpp: Create C++ Headers for Embedding Images	https://www.codeproject.com/Articles/5336116/Img2Cpp-Create-Cplusplus-Headers-for-Embedding-Ima	image	2022-07-05 22:41:00
海外科学	NYT > Science	Fields Medals in Mathematics Won by Four Under Age 40	https://www.nytimes.com/live/2022/07/05/science/fields-medal-math	complex	2022-07-05 22:07:30
海外科学	NYT > Science	Who Is June Huh?	https://www.nytimes.com/2022/07/05/science/june-huh-heisuke-hironaka-math-chromatic-geometry.html	journalist	2022-07-05 22:07:28
金融	金融総合：経済レポート一覧	激震続く暗号資産市場は冬の時代に入ったのか～銀行であれば取り付け騒ぎ（バンクラン）に...：木内登英のGlobal Economy ＆ Policy Insight	http://www3.keizaireport.com/report.php/RID/502098/?rss	lobaleconomypolicyinsight	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	Thought Leaderに訊く：経済安全保障推進法の金融ビジネスへの影響～森・濱田松本法律事務所 パートナー弁護士 梅津 英明氏	http://www3.keizaireport.com/report.php/RID/502099/?rss	thoughtleader	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	FX Daily（7月4日）～ドル円、135円台後半まで上昇	http://www3.keizaireport.com/report.php/RID/502102/?rss	fxdaily	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	ロシア国債デフォルト騒動の本質～返済能力も意思もあるロシア政府は徹底抗戦の構え：欧州	http://www3.keizaireport.com/report.php/RID/502103/?rss	大和総研	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	金融サービスにおける「ナッジ」活用の功罪	http://www3.keizaireport.com/report.php/RID/502104/?rss	大和総研	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	Ｆｅｄがインフレと一緒に退治してしまったもの ＩＳＭはゲームチェンジャーに？：Market Flash	http://www3.keizaireport.com/report.php/RID/502105/?rss	marketflash	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	欧州保険会社が2021年のSFCR（ソルベンシー財務状況報告書）を公表（３）～SFCRからの具体的内容の抜粋報告（その２）：保険・年金フォーカス	http://www3.keizaireport.com/report.php/RID/502110/?rss	保険会社	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	今年上期のJリート市場は▲4.8％下落。14年ぶりの行政処分勧告も～スポンサー取引における忠実義務違反は、市場に迷い込んだネズミか、それともゾウか？：研究員の眼	http://www3.keizaireport.com/report.php/RID/502111/?rss	行政処分	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	要請が強まるジェンダーダイバーシティ：ニッセイ年金ストラテジー	http://www3.keizaireport.com/report.php/RID/502116/?rss	要請	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	国内の企業年金基金のPRI署名はなぜ進まない？：ニッセイ年金ストラテジー	http://www3.keizaireport.com/report.php/RID/502117/?rss	企業年金基金	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	オルタナティブ投資の見直しを：ニッセイ年金ストラテジー	http://www3.keizaireport.com/report.php/RID/502118/?rss	見直し	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	動的資産配分による掛金の安定化：ニッセイ年金ストラテジー	http://www3.keizaireport.com/report.php/RID/502119/?rss	配分	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	年金改革ウォッチ 2022年7月号～将来推計人口では、中長期仮定を見直しつつ、コロナ禍の影響を加味：ニッセイ年金ストラテジー	http://www3.keizaireport.com/report.php/RID/502120/?rss	将来推計人口	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	プライベート・エクイティ市場が直面する4つのリスクと、それらが示唆する新規投資先とは？	http://www3.keizaireport.com/report.php/RID/502122/?rss	示唆	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	【石黒英之のMarket Navi】米経済はテクニカルリセッション入りの可能性～金融市場の緊張が高まりつつある...	http://www3.keizaireport.com/report.php/RID/502124/?rss	marketnavi	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	マーケットフォーカス（欧州市場）2022年7月号～株式市場は下落。	http://www3.keizaireport.com/report.php/RID/502125/?rss	三井住友トラスト	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	マーケットフォーカス（米国市場）2022年7月号～NYダウは、大幅に下落...	http://www3.keizaireport.com/report.php/RID/502126/?rss	三井住友トラスト	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	J-REIT市場 現状と今後の見通し（2022年7月号）～2022年6月の東証REIT指数は、前月末比－1.95％の1,966.90ポイントで引けました。	http://www3.keizaireport.com/report.php/RID/502127/?rss	jreit	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	グローバルREITウィークリー 2022年7月第1週号～先週のグローバルREIT市場は、前週末比で▲0.6％となりました。	http://www3.keizaireport.com/report.php/RID/502128/?rss	日興アセットマネジメント	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	歴代首相の在任期間と日経平均株価の関係：市川レポート	http://www3.keizaireport.com/report.php/RID/502129/?rss	三井住友	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	【注目検索キーワード】ブルーカーボン	http://search.keizaireport.com/search.php/-/keyword=ブルーカーボン/?rss	検索キーワード	2022-07-06 00:00:00
金融	金融総合：経済レポート一覧	【お薦め書籍】世界2.0 メタバースの歩き方と創り方	https://www.amazon.co.jp/exec/obidos/ASIN/4344039548/keizaireport-22/	宇宙開発	2022-07-06 00:00:00
ニュース	BBC News - Home	Suspect charged with murder over 4 July shooting	https://www.bbc.co.uk/news/world-us-canada-62059341?at_medium=RSS&at_campaign=KARANGA	chicago	2022-07-05 22:49:43
ニュース	BBC News - Home	Norway calls off gas strikes that risked UK supply	https://www.bbc.co.uk/news/business-62058512?at_medium=RSS&at_campaign=KARANGA	deliveries	2022-07-05 22:03:25
ニュース	BBC News - Home	Chicago shooting: Parents of two-year-old boy among victims	https://www.bbc.co.uk/news/world-us-canada-62047223?at_medium=RSS&at_campaign=KARANGA	aiden	2022-07-05 22:54:54
ビジネス	ダイヤモンド・オンライン - 新着記事	アマゾンなどクラウド3強、業界支配一段と - WSJ発	https://diamond.jp/articles/-/305995	業界	2022-07-06 07:17:00
ビジネス	ダイヤモンド・オンライン - 新着記事	IAEA事務局長、核のリスク拡大を警告 - WSJ発	https://diamond.jp/articles/-/305996	事務局長	2022-07-06 07:01:00
北海道	北海道新聞	自公、改選過半数へ堅調　立憲苦戦、維新に勢い	https://www.hokkaido-np.co.jp/article/702228/	世論調査	2022-07-06 07:50:05
北海道	北海道新聞	ダルビッシュ、次回登板は１０日　本拠地でジャイアンツ戦	https://www.hokkaido-np.co.jp/article/702241/	大リーグ	2022-07-06 07:34:00
北海道	北海道新聞	女装し犯行、７０発以上乱射　米銃撃容疑者、事前に計画	https://www.hokkaido-np.co.jp/article/702221/	銃撃	2022-07-06 07:20:00
北海道	北海道新聞	札幌・真駒内公園でクマ目撃　住宅地まで２００ｍ	https://www.hokkaido-np.co.jp/article/702240/	札幌市南区	2022-07-06 07:30:45