Abstract
This paper describes how to design a Encription circuit Based on GF(24) field arithmatic. The New Multiplier circuit is compared with the binary multiplier and finding that the Galois multiplier is much faster and more economical are. Since the new endecripting circuit is much more simple than the classical design, the amount of computing for the en/decrypting algorithms is also greately reduced. We show the encryption and decription process using galois field computation in contrast to the classical en/decrypting process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-qdah, M.: Simple Encription and Decription algorithm. International Journal of Computer Science and Security, IJCSS 1, 33–40 (2007)
Brauchle, J., Koetter, R.: A Systematic Reed Solomon Encoder with Arbitrary Parity positions. In: IEEE GLOBECOM 2009 Proceedings (2009)
Cury, M.L., Skjellum, A., Ward, H.L.: Accelerating Reed-Solomon coding in RAID systems with GPUs. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008 (2008)
Leach, Malvino, Saha: HDL descriptions of Full Adder in the text Digital Principles and applications. In: TMH 2006 (2006)
An, H.-K.: Optimal Design of Multiplying and Dividing Circuit for Reed-Solomon ECC Codec Processor. In: Lee, G., Howard, D., Kang, J.J., Ślęzak, D. (eds.) ICHIT 2012. LNCS, vol. 7425, pp. 574–581. Springer, Heidelberg (2012)
Payment Card Industry, Encription Decription and Key Management within secure Cryptographic Devices (September 2011)
Altera Corp., Reed Solomon Encoder reference design: 2.5G Megacore function, Application Note AN-642-1.0 (March 2011)
Pavel, P., Elyar, G.: Variable redundancy Reed-Solomon encoder, USP 8176397 (May 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
An, HK. (2012). New Encripting Machine Design Based on GF(24) Field Arithmatic. In: Kim, Th., Cho, Hs., Gervasi, O., Yau, S.S. (eds) Computer Applications for Graphics, Grid Computing, and Industrial Environment. CGAG GDC IESH 2012 2012 2012. Communications in Computer and Information Science, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35600-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-35600-1_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35599-8
Online ISBN: 978-3-642-35600-1
eBook Packages: Computer ScienceComputer Science (R0)