URL:
<https://savannah.gnu.org/task/?15045>
Summary: Submission of Gauss-Jacques method
Project: Savannah Administration
Submitted by: abejacques
Submitted on: Mon 17 Sep 2018 05:11:30 PM UTC
Should Start On: Mon 17 Sep 2018 12:00:00 AM UTC
Should be Finished on: Thu 27 Sep 2018 12:00:00 AM UTC
Category: Project Approval
Priority: 5 - Normal
Status: None
Privacy: Public
Percent Complete: 0%
Assigned to: None
Open/Closed: Open
Discussion Lock: Any
Effort: 0.00
_______________________________________________________
Details:
A new project has been registered at Savannah
This project account will remain inactive until a site admin approves
or discards the registration.
= Registration Administration =
While this item will be useful to track the registration process,
*approving or discarding the registration must be done using the specific
Group Administration
<https://savannah.gnu.org/siteadmin/groupedit.php?group_id=11861> page*,
accessible only to site administrators,
effectively *logged as site administrators* (superuser):
* Group Administration
<https://savannah.gnu.org/siteadmin/groupedit.php?group_id=11861>
= Registration Details =
* Name: *Gauss-Jacques method*
* System Name: *modularinverse*
* Type: non-GNU software and documentation
* License: GNU General Public License v2 or later (Safe Creative Licence
URL Inf:
http://www.safecreative.org/work/1809148373934-gauss-jacques-method-in-octave-mathlab
URL certified publication
https://www.safecreative.org/certifiedPublication/1809140001521)
----
==== Description: ====
It is a brand new method to obtain modular inverse matrices sized n x n
considering computational efficiency and applications in symmetric
cryptography.
This method is published at CIENCIA@UAQ:
https://www.uaq.mx/investigacion/revista_ciencia@uaq/ArchivosPDF/v11-n1/art14_numerada-VF.pdf
CIENCIA@UAQ is a scientific indexed magazine.
This method is computationally efficient and does not use determinants and the
adjoint matrix in its calculation.
Bigger modular inverse matrices can be obtained than the existing functions.
Its polynomial is: f(n, m) = ((n3)+((n2-n)/2)+(m2+m)), where n stands for the
size of the matrix, and m stands for the modulo m to work with.
==== Tarball URL: ====
https://savannah.gnu.org/submissions_uploads/invModJac.tar.gz
_______________________________________________________
Reply to this item at:
<https://savannah.gnu.org/task/?15045>
_______________________________________________
Message sent via Savannah
https://savannah.gnu.org/
