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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Published: |
Philippine Association of Institutions for Research, Inc.,
2018-01-01T00:00:00Z.
|
| Subjects: | |
| Online Access: | Connect to this object online. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Connect to this object online.3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |