GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - BitPolito/Asymmetric-CryptoGraphy

BranchesTags
Open more actions menu

Latest commit

 

History

7 Commits
7 Commits

Folders and files

NameName
Last commit message
Last commit date
assets
assets
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 
address.js
address.js
 
 
app.js
app.js
 
 
bundle.js
bundle.js
 
 
crypto.js
crypto.js
 
 
debug_console.js
debug_console.js
 
 
graph.js
graph.js
 
 
index.html
index.html
 
 
merkle.js
merkle.js
 
 
package-lock.json
package-lock.json
 
 
package.json
package.json
 
 
styles.css
styles.css
 
 
test_extended_steps.js
test_extended_steps.js
 
 
test_graph_view.js
test_graph_view.js
 
 
test_merkle_simulator.js
test_merkle_simulator.js
 
 
test_mod_5g.js
test_mod_5g.js
 
 
test_point_to_address.js
test_point_to_address.js
 
 
test_sim.js
test_sim.js
 
 

Repository files navigation

Bitpolito Cryptography Simulator

An interactive Bitcoin secp256k1 elliptic curve asymmetric cryptography simulator designed with soft neumorphic floating aesthetics, and an interactive 2D graph with finite field modulo ($p$) and continuous ($\mathbb{R}$) point stepping.

📐 Mathematical Foundation (Bitcoin secp256k1)

Authentic, zero-dependency BigInt point arithmetic on the Bitcoin curve:

$$y^2 \equiv x^3 + 7 \pmod p$$

Where:

  • Field Prime ($p$): $2^{256} - 2^{32} - 977 = \text{0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F}$
  • Generator Point ($G$):
    • $G_x = \text{0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798}$
    • $G_y = \text{0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8}$

Key Generation

  1. Private Key ($d$): Random 256-bit scalar ($1 \le d < n$).
  2. Public Key ($Q$): Point scalar multiplication $Q = d \cdot G$.

💻 Local Execution

# Serve locally via Python
python3 -m http.server 8080

# Open in browser
http://localhost:8080

BitPolitoAsymmetricCryptoGraphy

About

No description or website provided.

Topics

cryptographyeducation

Resources

Readme
Activity
Custom properties

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

Packages

Used by

Contributors

Languages

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.