Sierpiński Proth Multiple Variable Non-quadratic Totient Mod
Version 1.0.0 (2,38 ko) par
steed huang
Multivariate Polynomial Signature with a prime p is product of odd prime number q multiplied with a power x of two and then plus one.
Multivariate Polynomial Public Key Digital Signature (MPPK/DS) algorithm is based on the modular arithmetic property Euler power totient that for a given element g, greater than equal to two, in a prime Galois field GF(p) and two multivariate polynomials P and Q, if P is equal to Q modulo p‑1, then g to the power of P is equal to g to the power of Q modulo p. MPPK/DS is designed to make secret the element g disfavors quantum computers’ capability to solve the discrete logarithm problem, p is a sum of a product of an odd prime number q multiplied with a power x of two and one. Given such a choice of a prime, choosing even coefficients of the publicly available polynomials makes it hard to find any private information modulo p‑1, finding private information modulo the components q and power x of two is an NP‑hard problem since it involves solving multivariate equations over the chosen finite field.
Citation pour cette source
steed huang (2024). Sierpiński Proth Multiple Variable Non-quadratic Totient Mod (https://www.mathworks.com/matlabcentral/fileexchange/120763-sierpinski-proth-multiple-variable-non-quadratic-totient-mod), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Créé avec
R2022b
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS LinuxTags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.0.0 |