Suppose I make an application with a password of max 20 characters -- no special characters and not case-sensitive. So that means there is a 1-to-1 correspondence between the set of all passwords P and the set S = {1, 2, ..., 37(adsbygoogle = window.adsbygoogle || []).push({}); ^{20}- 1, 37^{20}}. A simple bijective function f:P-->S could be constructed. Then I want to construct another bijective function g:S-->T for some set T. Any ideas?

**Physics Forums - The Fusion of Science and Community**

# Help me make a very mathematical encryption algorithm

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Help me make a very mathematical encryption algorithm

Loading...

**Physics Forums - The Fusion of Science and Community**