This repository hosts the code of a whole new cryptographic function, using the Lagrange Polynomial. A new hashing polynomial has been created by myself. The justification, and the explicit method is explained (in french) in the following paper : Study paper

No security proof has been made. It has been created in order to give an pratical and efficient example of what can be done with that method. This should not be used for other reason than study and absolutely not for security reasons.

This code source is published under GPLv3 licence.

Copyright (C) 2021  Nathan Stchepinsky

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <https://www.gnu.org/licenses/>.

Clone this project on your laptop by using this link or by executing the following command in your terminal :

git clone https://github.com/DevNathan/hash_lagrange_polynomial

from hash_lagrange import *

hash_len = 32 # Length of the produced hash (in char)

lagrange = Lagrange(hash_len)

message = "Hello world !"

hash_str = lagrange.hash(message)

Hashing "Hello world !" on 32 char.

🔒 Hash :  kk31q6ojgqeeihwfshzus1f1xxek84xa


** Sucessfuly hashed in  0.013  seconds **

You can see more example, including proof of the padding and the avalanche effect, in the study paper

For security report or security issue, please contact me at [email protected].

PGP Key : https://keybase.io/devnath/pgp_keys.asc?fingerprint=8c7bae7de486c1b4441ed2e197881b1f87e35cf5