Update for 31-01-22 21:00
This commit is contained in:
parent
35942c30fe
commit
0182351903
|
|
@ -1,23 +0,0 @@
|
|||
= Languages =
|
||||
|
||||
== Sections ==
|
||||
|
||||
* [[C|C]]
|
||||
* [[C++|C++]]
|
||||
* [[C-sharp|C#]]
|
||||
* [[Python|Python]]
|
||||
* [[Bash|Bash]]
|
||||
* [[HTML|HTML]]
|
||||
* [[CSS|CSS]]
|
||||
* [[Javascript|Javascript]]
|
||||
* [[PHP|PHP]]
|
||||
* [[Rust|Rust]]
|
||||
* [[Go|Go]]
|
||||
* [[sql|SQL]]
|
||||
* [[x86|x86]]
|
||||
|
||||
== Also see ==
|
||||
|
||||
* [[../tech/index]]
|
||||
|
||||
[[../index]]
|
||||
|
|
@ -1,9 +0,0 @@
|
|||
= eliptic Curve =
|
||||
|
||||
An eliptic curve is a curve of form:
|
||||
|
||||
```
|
||||
y^2 = x^3 + ax + b
|
||||
```
|
||||
|
||||
They often curve around the origin
|
||||
|
|
@ -1,4 +0,0 @@
|
|||
= Greatest Common Denominator =
|
||||
|
||||
A greatest common denominator or GCD is the largest number that two numbers can
|
||||
both divide into
|
||||
|
|
@ -1,18 +0,0 @@
|
|||
= Math =
|
||||
|
||||
The purest study of them all
|
||||
|
||||
== Topics ==
|
||||
|
||||
* [[proofs]]
|
||||
|
||||
=== Number Theory ===
|
||||
|
||||
* [[prime]]
|
||||
* [[relative_prime]]
|
||||
* [[modular_inverse]]
|
||||
* [[euclidean_algorithm]]
|
||||
|
||||
=== Computer Science ===
|
||||
|
||||
* [[markov_chain]]
|
||||
|
|
@ -1,12 +1,9 @@
|
|||
= Eliptic Curve Cryptography =
|
||||
|
||||
ECC is an algorithm that solves the same problem as [[RSA]], but with smaller
|
||||
key sizes. It is asymetric and based on [[../math/Eliptic_Curve]]s and based on
|
||||
the difficulty of inding a curve given points on said curve, and a
|
||||
[[../math/Trap_door]]
|
||||
|
||||
== algorithm ==
|
||||
|
||||
= eliptic Curve =
|
||||
|
||||
An eliptic curve is a curve of form:
|
||||
|
||||
```
|
||||
y^2 = x^3 + ax + b
|
||||
```
|
||||
|
||||
They often curve around the origin
|
||||
|
|
|
|||
|
|
@ -1,16 +1,4 @@
|
|||
= GCD =
|
||||
= Greatest Common Denominator =
|
||||
|
||||
Greatest common divisor is the multiple that two numbers have in common
|
||||
|
||||
== Extended Euclidean's Algorihtm ==
|
||||
|
||||
Way to find the greatest common divisor of two numbers
|
||||
|
||||
* Theorm
|
||||
- If m,n are relatively prime then n has an inverse mod m
|
||||
* n^-1 = b mod m
|
||||
- Where a,b are any integer solutions to
|
||||
* a * m = b * n = 1 mod m
|
||||
- and b would be a modular inverse of n
|
||||
|
||||
[[index]]
|
||||
A greatest common denominator or GCD is the largest number that two numbers can
|
||||
both divide into
|
||||
|
|
|
|||
|
|
@ -1,22 +1,23 @@
|
|||
= Tech =
|
||||
|
||||
Everything dealing with my awful addiction to computers
|
||||
= Languages =
|
||||
|
||||
== Sections ==
|
||||
* [[security|Security]] - Security tools and techniques
|
||||
* [[development|Development]] - Development tools
|
||||
* [[algorithms|Algorithms & Datastructures]] - Algorithms and Data structures
|
||||
* [[databases|Databases & SQL]] - Databases and SQL
|
||||
* [[os|Operating Systems Design]] - Basic building blocks of an OS
|
||||
* [[embedded|Embedded Programming]] - Embedded Systems like arduinos and (kinda) pi's
|
||||
* [[electronics|Digital and Analog]] - Digital and analog electronics
|
||||
* [[unix|Unix]] - Gentoo and other unix systems
|
||||
* [[3D_printing|3D Printing]] - Print objects from plastic
|
||||
* [[android|Android]]
|
||||
* [[misc|Misc]] - Miscellaneous tools
|
||||
|
||||
* [[C|C]]
|
||||
* [[C++|C++]]
|
||||
* [[C-sharp|C#]]
|
||||
* [[Python|Python]]
|
||||
* [[Bash|Bash]]
|
||||
* [[HTML|HTML]]
|
||||
* [[CSS|CSS]]
|
||||
* [[Javascript|Javascript]]
|
||||
* [[PHP|PHP]]
|
||||
* [[Rust|Rust]]
|
||||
* [[Go|Go]]
|
||||
* [[sql|SQL]]
|
||||
* [[x86|x86]]
|
||||
|
||||
== Also see ==
|
||||
|
||||
* [[../lang/index]]
|
||||
* [[../tech/index]]
|
||||
|
||||
[[../index]]
|
||||
|
|
|
|||
Loading…
Reference in New Issue