Search Results for "character recognition code"
Sort By:
Showing 2 open source projects for "character recognition code"
View related business solutions-
Failed Payment Recovery for Subscription BusinessesFlexPay’s innovative platform uses multiple technologies to achieve the highest number of retained customers, resulting in reduced involuntary churn, longer life span after recovery, and higher revenue. Leading brands like LegalZoom, Hooked on Phonics, and ClinicSense trust FlexPay to recover failed payments, reduce churn, and increase customer lifetime value.
-
The full-stack observability platform that protects your dataLayer, tags and conversion dataCode-Cube.io detects issues instantly, alerts you in real time and helps you resolve them fast. No manual QA. No unreliable data. Just data you can trust and act on.
-
1
PureBasic Shamir Secret Sharing
Open-source PureBasic implementation of the Shamir Secret Sharing
...This implementation operates over the finite field GF(257), allowing correct handling of all byte values (0–255) without loss, making it compatible with any type of string or binary-compatible data. Main Features Complete implementation of Shamir Secret Sharing Arithmetic over GF(257) Compatible with all character strings Robust Lagrange interpolation Safe modular inverse computation Shares encoded in hexadecimal (3 characters per byte) Clear, well-commented source code ⚠️ Disclaimer This project is intended for educational and demonstration -
2
Simplest Text Encrypter
A simple example of polyalphabetic cipher in Java.
Cryptography fascinates everyone. A variety of encryption techniques and ciphers are used to code important data. A polyalphabetic cipher is one of the simplest cipher one can make. This is a Java program to implement polyalphabetic cipher. [How the cipher encodes?] Input Data: helloaf Key: love l - 12th letter in Alphabet o - 15th letter in Alphabet v - 22nd letter in Alphabet e - 5th letter in Alphabet Now: h(l) e(o) l(v) l(e) o(l) a(o) f(v) Further: h(+12) e(+15) l(+22) l(+5) o(+12) a(+15) f(+22) where +(number) meaning shifting the character forward by the respective number of places. ...
- Previous
- You're on page 1
- Next
