Explore >> Select a destination
|
You are here 
|
lambdaland.org | ||
| | | | |
shrik3.com
|
|
| | | | | [AI summary] This post explains the RSA algorithm, its mathematical foundations, and applications in cryptography, including key generation, encryption/decryption processes, and security principles. | |
| | | | |
bentnib.org
|
|
| | | | | ||
| | | | |
adam.chlipala.net
|
|
| | | | | [AI summary] This text provides an in-depth exploration of advanced Coq proof techniques, focusing on manual proofs, recursion, and induction principles for complex data structures. It covers topics like nested inductive types, custom induction principles, and the design philosophy behind Coq's approach to proof automation. The text includes detailed examples of proof scripts, such as manual proofs for discrimination and injectivity of constructors, and discusses the use of tactics like discriminate and injection. It also touches on the implementation of functions like pred and the role of hints in improving proof readability and automation. | |
| | | | |
mfbmina.dev
|
|
| | | Introdução RSA is a public/private encryption algorithm and it is based on the difficulty of the factorization of the product of two large prime numbers. It was named after its creators Rivest, Shamir, and Adleman. It is an expensive algorithm, computationally speaking, and because of this, it is not common to use it directly, but it is still widely used in the market and is one of the most important encryption algorithms. As an example, OpenSSL implements this algorithm for generating keys and it is com... | ||
