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**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Help me make a very mathematical encryption algorithm

Loading...

Similar Threads - Help very mathematical | Date |
---|---|

Future Technology: Helpful or Harmful? | Jan 13, 2018 |

Can I upgrade my laptop? | Oct 21, 2017 |

Desktop very slow | Jul 14, 2017 |

Help with Firefox | Jun 13, 2017 |

AVG antivirus help | Mar 27, 2017 |

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