On Generalized Solutions of Linear Congruence ax = b (mod n) for Large Modulus n
Number Theory, a branch of Pure Mathematics, is crucial in cryptographic algorithms. Many cryptographic systems depend heavily on some topics of Number Theory. One of these topics is the linear congruence. In cryptography, the concept of linear congruence is used to directly underpin public key cryp...
Bewaard in:
Hoofdauteur: | |
---|---|
Formaat: | Boek |
Gepubliceerd in: |
Philippine Association of Institutions for Research, Inc.,
2018-01-01T00:00:00Z.
|
Onderwerpen: | |
Online toegang: | Connect to this object online. |
Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|
Internet
Connect to this object online.3rd Floor Main Library
Plaatsingsnummer: |
A1234.567 |
---|---|
Kopie 1 | Beschikbaar |