Modification on the Algorithm of RSA Cryptography System

Authors

  • Assad Ibraheem Khyoon College of Engineering Diala University

Abstract

Abstract

The protection of information for long period time is very critical in many environments. One way of implementation this protection with high activity is RSA cryptosystem. In this paper the old algorithm of RSA system is showed. And for more complexity and to increase time of attack coding. A new coefficient is z has been added to generator function Φ(n) in additional to selected p and q witch are depended in old algorithm. Furthermore: A flowchart of this moderation is presented with corresponding Matlab program ,and for more illustration one mathematical example is employed here

References

REFERENCES

S.Babbage and L. Frisch. On MISTY1 Higher Order Di_erential

Cryptanalysis. Proceedings

of ICISC 2000, Lecture Notes in Computer Science 2015, Springer-Verlag,

, 22{36.

E. Barkan, E. Biham and N. Keller. Instant Ciphertext-Only Cryptanalysis

of GSM

Encrypted Communication. Proceedings of Crypto 2003, Springer-Verlag,

J. S. Kang, S. U. Shin, D. W. Hong, O. Y. Yi. Provable Security of

KASUMI and

GPP Encryption Mode f8. Advances in Cryptology - Asiacrypt 2001, Lecture

Notes

in Computer Science 2248, Springer-Verlag, 2001.

L.R. Knudsen and C.J. Mitchell. An analysis of the 3gpp-MAC scheme. In

Daniel

Augot and Claude Carlet (Eds.) Workshop on Coding and Cryptography, WCC

,

Les Ecoles de Cotquidan, 2001, 319-328.

L.R. Knudsen and D. Wagner. Integral Cryptanalysis. In J. Daemen and V.

Rijmen

(Eds.) Fast Software Encryption - FSE 2002, Lecture Notes in Computer

Science

, Springer-Verlag, 2002, 112{127.

U. Kuhn. Cryptanalysis of Reduced-Round MISTY. In B. P_tzmann (Ed.)

Advances

in Cryptology - Eurocrypt 2001, Lecture Notes in Computer Science 2045,

Springer-Verlag, 2001, 325{339.

Published

2023-05-24

How to Cite

[1]
Assad Ibraheem Khyoon, “Modification on the Algorithm of RSA Cryptography System”, jfath, vol. 9, no. 3, pp. 1–14, May 2023.