Crypto Math
crypto-math.x402tookit.com
RSA public key arithmetic: modulus bits, exponent validity, NIST strength; or a labelled toy RSA with tiny primes.
- Category
- Service
- Networks
- BaseSolanaPolygonArbitrum
- Starting price
- $0.02
- Paid calls, 30 days
- 12
Paid endpoints
6 endpoints, sorted by usage. Prices are per request.
| Endpoint | Price | Network | Facilitator | Calls / 30d |
|---|---|---|---|---|
GET/check-digits Generate or validate Luhn and ISO 7064 mod 97-10 (IBAN style) check digits from the string you supply. | $0.02 | Base | Coinbase CDP | 2 |
GET/crt Solve x = a1 (mod m1), x = a2 (mod m2), ... with the Chinese remainder theorem, coprime or not. | $0.02 | Base | Coinbase CDP | 2 |
GET/entropy Shannon entropy in bits per symbol from a frequency table, plus min-entropy, collision entropy and efficiency. | $0.02 | Base | Coinbase CDP | 2 |
GET/mod-pow Modular exponentiation base^exp mod m for big integers, decimal or 0x hex, up to 4096 bits. | $0.02 | Base | Coinbase CDP | 2 |
GET/prime Primality test (deterministic Miller-Rabin below 2^64) plus the next and previous prime, with BigInt. | $0.02 | Base | Coinbase CDP | 2 |
GET/rsa-arith RSA public key arithmetic: modulus bits, exponent validity, NIST strength; or a labelled toy RSA with tiny primes. | $0.02 | Base | Coinbase CDP | 2 |
Is this your project? Suggest an edit.