taskSavannah Administration - Tasks: task #15045, Submission of Gauss-Jacques method

 
 

task #15045: Submission of Gauss-Jacques method

Submitter:  Abraham Jacques <abejacques>
Submitted:  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:  Cancelled Privacy:  Public
Assigned to:  ineiev Open/Closed:  Closed
* Mandatory Fields

Add a New Comment Rich Markup
   

Tue 18 Sep 2018 01:02:12 PM UTC, comment #1: 

Duplicates task #15046; cancelling.

Ineiev <ineiev>
Site Administrator
Mon 17 Sep 2018 05:11:30 PM UTC, original submission:  

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 page, accessible only to site administrators,
effectively logged as site administrators (superuser):



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


Abraham Jacques <abejacques>

 

(Note: upload size limit is set to 16384 kB, after insertion of the required escape characters.)

Attach Files:
   
   
Comment:
   

No files currently attached

 

Depends on the following items: None found

Items that depend on this one: None found

 

Carbon-Copy List
  • -email is unavailable- added by ineiev (Posted a comment)
  • -email is unavailable- added by abejacques (Submitted the item)
  •  

    There are 0 votes so far. Votes easily highlight which items people would like to see resolved in priority, independently of the priority of the item set by tracker managers.

    Only logged-in users can vote.

     

    Follow 3 latest changes.

    Date Changed by Updated Field Previous Value => Replaced by
    2018-09-18 ineiev StatusNone Cancelled
        Assigned toNone ineiev
        Open/ClosedOpen Closed

    Back to the top

    Powered by Savane 3.13-f8d8.
    Corresponding source code