{"id":22472512,"url":"https://github.com/theduardomaciel/cc-md","last_synced_at":"2025-03-27T16:22:47.856Z","repository":{"id":188687152,"uuid":"678948366","full_name":"theduardomaciel/cc-md","owner":"theduardomaciel","description":"Repository with all source files developed during the Discrete Math (MD) subject of my undergraduate course in Computer Science (CC).","archived":false,"fork":false,"pushed_at":"2023-12-19T04:00:13.000Z","size":211,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-01T20:11:32.085Z","etag":null,"topics":["c","criptografia","criptografia-rsa","criptography","gcc","rsa-cryptography"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/theduardomaciel.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-08-15T18:57:35.000Z","updated_at":"2023-08-21T17:21:53.000Z","dependencies_parsed_at":null,"dependency_job_id":"6f670318-2164-4682-9038-b176687843ca","html_url":"https://github.com/theduardomaciel/cc-md","commit_stats":null,"previous_names":["theduardomaciel/cc-md"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theduardomaciel%2Fcc-md","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theduardomaciel%2Fcc-md/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theduardomaciel%2Fcc-md/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theduardomaciel%2Fcc-md/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/theduardomaciel","download_url":"https://codeload.github.com/theduardomaciel/cc-md/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245879453,"owners_count":20687385,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","criptografia","criptografia-rsa","criptography","gcc","rsa-cryptography"],"created_at":"2024-12-06T12:16:00.686Z","updated_at":"2025-03-27T16:22:47.834Z","avatar_url":"https://github.com/theduardomaciel.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Matemática Discreta\n\nRepositório contendo todos os arquivos fonte em C desenvolvidos durante a matéria Matemática Discreta (MD) do curso de Graduação em Ciência da Computação (CC) na Universidade Federal de Alagoas (UFAL).\n\n## Links úteis\n\n#### Números primos\n\n##### Crivo de Atkin\n-   [Implementação em C++](https://github.com/fylux/SieveOfAtkin)\n-   [Artigo explicando o Crivo de Atkin de maneira simplificada](https://fylux.github.io/2017/03/16/Sieve-Of-Atkin/)\n-   [Artigo na Wikipédia conceituando o Crivo de Atkin](https://en.wikipedia.org/wiki/Sieve_of_Atkin)\n-   [Implementação otimizada do crivo em C](http://cr.yp.to/primegen.html)\n-   [Artigo original dos desenvolvedores do Crivo de Atkin](https://www.ams.org/journals/mcom/2004-73-246/S0025-5718-03-01501-1/S0025-5718-03-01501-1.pdf)\n\n##### Crivo de Erastótenes\n-   [Artigo explicando o Crivo de Erastótenes de maneira simplificada](https://www.keil.com/benchmarks/sieve.asp)\n-   [Artigo na Wikipédia conceituando o Crivo de Erastótenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)\n-   [Biblioteca incrivelmente otimizada que utiliza o Crivo de Erastótenes](https://github.com/kimwalisch/primesieve)\n-   [Site explicando como um algoritmo de crivo segmentado foi realizado](https://sites.google.com/site/bbuhrow/home/cuda-sieve-of-eratosthenes)~\n-   [Outro site explicando o conceito do crivo e implementando em Java e C++](https://www.algolist.net/Algorithms/Number_theoretic/Sieve_of_Eratosthenes)\n-   [Artigo explicando o crivo de maneira incremental](https://www.codevamping.com/2019/01/incremental-sieve-of-eratosthenes/)\n\n###### Códigos de exemplo\n-   [Código utilizado como benchmark](http://www.cs.nthu.edu.tw/~tingting/Archi_07/benchmark/sieve.c)\n-   [Código que implementa alguns métodos de otimização](http://wwwhomes.uni-bielefeld.de/achim/prime_sieve.c)\n\n\u003e [Resposta no Stack Overflow comparando os Crivos de Atkin e Erastótenes](https://stackoverflow.com/questions/19388106/the-sieve-of-atkin/22161595#22161595)\n\n##### Provar primalidade\n-   [Artigo (em inglês) mostrando como encontrar primos e provar que o são](https://t5k.org/prove/prove2_3.html)\n-   [Artigo (em inglês) sobre a prova de primalidade](https://en.wikipedia.org/wiki/Primality_test)\n\n#### Combinação Linear\n-   [Resposta acerca de como realizar uma combinação linear](https://math.stackexchange.com/questions/1258117/coefficients-of-a-linear-combination)\n-   [Algoritmo para encontrar os coeficientes de um MDC como combinação linear](https://math.stackexchange.com/questions/981773/algorithm-to-find-the-coefficient-of-gcd-linear-combination)\n-   [Calculadora de MDC como combinação linear](https://mathcenter.oxford.emory.edu/site/math125/toolGcdAsLinearCombination/index.php)\n-   [Competição para encontrar os coeficientes de um MMC como combinação linear](https://www.codewars.com/kata/63304cd2c68f640016b5d162)\n-   [Artigo explicando como realizar o Algoritmo de Euclides extendido](https://www.geeksforgeeks.org/euclidean-algorithms-basic-and-extended/)\n\n#### Inversos Modulares\n-   [Artigo explicando o que são e como calcular os inversos modulares](https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/modular-inverses)\n-   [Artigo com exemplos de código mostrando como calcular inversos modulares](https://www.geeksforgeeks.org/multiplicative-inverse-under-modulo-m/)\n\n#### Site geral que realiza os mais diversos tipos de cálculo matemático: https://www.dcode.fr/extended-gcd\n#### Site que explica o funcionamento do algoritmo RSA passo a passo: https://www.cryptool.org/en/cto/rsa-step-by-step\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheduardomaciel%2Fcc-md","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheduardomaciel%2Fcc-md","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheduardomaciel%2Fcc-md/lists"}