{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":626369277,"defaultBranch":"main","name":"Hill-Cipher-Algorithm","ownerLogin":"omarMohammedbenzo","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-04-11T10:30:35.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/113354292?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1681209111.0","currentOid":""},"activityList":{"items":[{"before":"b8e7a6d42bbc277187421997f83c8b8912363094","after":"a4fa8dbef9b026dd9dbec65e76d46414526e75af","ref":"refs/heads/main","pushedAt":"2023-04-11T12:40:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"omarMohammedbenzo","name":"Omar Mohammed","path":"/omarMohammedbenzo","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/113354292?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"f1dcb76cdb0c99dfd7cd4fc10e4c68e9593da198","after":"b8e7a6d42bbc277187421997f83c8b8912363094","ref":"refs/heads/main","pushedAt":"2023-04-11T12:16:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"omarMohammedbenzo","name":"Omar Mohammed","path":"/omarMohammedbenzo","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/113354292?s=80&v=4"},"commit":{"message":"Create README.md","shortMessageHtmlLink":"Create README.md"}},{"before":null,"after":"f1dcb76cdb0c99dfd7cd4fc10e4c68e9593da198","ref":"refs/heads/main","pushedAt":"2023-04-11T10:31:52.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"omarMohammedbenzo","name":"Omar Mohammed","path":"/omarMohammedbenzo","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/113354292?s=80&v=4"},"commit":{"message":"Add files via upload\n\nThe Hill cipher algorithm is a symmetric key cryptographic technique used for encryption and decryption of data. It was invented by Lester S. Hill in 1929 and is based on linear algebra.\r\n\r\nIn this algorithm, plaintext is divided into blocks of fixed size, which are then converted into numeric values according to a predetermined mapping. These numeric values are then multiplied by a matrix, which is the key of the cipher, to produce the ciphertext.\r\n\r\nTo decrypt the ciphertext, the inverse of the key matrix is multiplied with the ciphertext matrix to get back the original plaintext values. These numeric values are then converted back to their original format to retrieve the original plaintext.\r\n\r\nThe security of the Hill cipher algorithm depends on the size of the key matrix, and it can be vulnerable to certain attacks, such as known plaintext attacks and chosen plaintext attacks. Therefore, it is typically used for educational purposes rather than for secure communications.","shortMessageHtmlLink":"Add files via upload"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyMy0wNC0xMVQxMjo0MDoxMS4wMDAwMDBazwAAAAMWRbwS","startCursor":"Y3Vyc29yOnYyOpK7MjAyMy0wNC0xMVQxMjo0MDoxMS4wMDAwMDBazwAAAAMWRbwS","endCursor":"Y3Vyc29yOnYyOpK7MjAyMy0wNC0xMVQxMDozMTo1Mi4wMDAwMDBazwAAAAMWLx8N"}},"title":"Activity · omarMohammedbenzo/Hill-Cipher-Algorithm"}