Skip to main content
Have a personal or library account? Click to login
Note on Modular Reduction in Extended Finite Fields and Polynomial Rings for Simple Hardware Cover

Note on Modular Reduction in Extended Finite Fields and Polynomial Rings for Simple Hardware

Journal of Electrical Engineering
Volume 67 (2016): Issue 1 (January 2016)
By:   
Open Access
|Mar 2016
References

References

  1. [1] PATTERSON, N. J. : The Algebraic Decoding of Goppa Codes, IEEE Trans. on Information TheoryNo. 2 (2012), 203–207.
    Search in Google Scholar
  2. [2] FARKASOVA, K.—FARKAS, P.—RAKUS, M.—RUZICKY, E.—SILVA, A.—GAMEIRO, A. : Construction of Error Control Run Length Limited Codes Exploiting Some Parity Matrix Properties, Journal of Electrical EngineeringNo. 3 (2015), 182–184.
    Open DOISearch in Google Scholar
  3. [3] MALI, M.—NOVAK, F.—BIASIZZO, A. : Hardware Implementation of AES Algorithm, Journal of Electrical EngineeringNo. 9-10 (2005,), 265–269.
    Search in Google Scholar
  4. [4] RAKUS, M.—FARKAS, P. : Double Error Correcting Codes with Improved Code Rates, Journal of Electrical EngineeringNo. 3-4 (2004,), 89–94.
    Search in Google Scholar
  5. [5] EGOROV, S.—MARKARIAN, G. : Error Correction beyond the Conventional Error Bound for Reed-Solomon Codes, Journal of Electrical EngineeringNo. 11-12 (2003), 305=-310.
    Search in Google Scholar
  6. [6] RAKUS, M. : Comments on Weight Distribution of some Weighted Sum Codes for Erasure Correction, Journal of Electrical EngineeringNo. 5-6 (2002), 138–142.
    Search in Google Scholar
  7. [7] HEYSE, S.—GÜNEYSU, T. : Towards One Cycle per Bit Asymmetric Encryption: Code-Based Cryptography on Reconfigurable Hardware, CHES (2012), 340–355.
    Open DOISearch in Google Scholar
  8. [8] SHOUFAN, A.—WINK, T.—MOLTER, H. G.—HUSS, S. A.—KOHNERT, E. : A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem, IEEE Trans. ComputersNo. 11 (2010), 1533–1546.
    Open DOISearch in Google Scholar
  9. [9] BERNSTEIN, D. J.—LANGE, T.—PETERS, C. : Wild McEliece Incognito, 4th International Workshop, PQCrypto 2011, Proceedings, 2011, pp. 244–254.
    Open DOISearch in Google Scholar
  10. [10] REPKA, M. : McEliece PKC Calculator, Journal of Electrical EngineeringNo. 6 (2014),.
    Open DOISearch in Google Scholar
  11. [11] REPKA, M.—CAYREL, P.-L. : Cryptography Based on Error Correcting Codes: A Survey, Multidisciplinary Perspectives in Cryptology and Information Security (Sattar B. Sadkhan Al Maliky, and Nidaa A. Abaas, ed.), IGI Global, 2014, pp. 133-156.
    Open DOISearch in Google Scholar
  12. [12] AN, H.-K. : Fast and Low cost(2) Multiplier Design based on Double Subfield Transformation, International Journal of Software Engineering and Its ApplicationsNo. 4 (2013), 285–294.
    Search in Google Scholar
  13. [13] CHUANPENG, CH.—ZHONGPING, Q. : Fast Algorithm and Hardware Architecture for Modular Inversion in GF(p), Intelligent Networks and Intelligent Systems, 2009. ICINIS ’09. Second International Conference on, 43-45, DOI: 10.1109/ICINIS.2009.20.
    Open DOISearch in Google Scholar
  14. [14] MELIKOVIC, N. Z.—STANKOVIC, V.—MILIC, M. L. : Modular Design of Fast Leading Zeros Counting Circuit, Journal of Electrical EngineeringNo. 6 (2015), 329–333.
    Search in Google Scholar
DOI: https://doi.org/10.1515/jee-2016-0008 | Journal eISSN: 1339-309X (formerly 1335-3632) | Journal ISSN: 1335-3632
Journal RSS Feed
Language: English
Page range: 56 - 60
Submitted on: Oct 8, 2015
Published on: Mar 17, 2016
Published by: Slovak University of Technology in Bratislava
In partnership with: Paradigm Publishing Services
Keywords:
modular reduction,
extended finite fields,
extended polynomial rings,
algebraic codes,
McEliece PKC,
Niederreiter PKC
Related subjects:
Engineering,
Introductions and overviews,
Engineering, other

© 2016 Marek Repka, published by Slovak University of Technology in Bratislava
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 67 (2016): Issue 1 (January 2016)
Previous article
Next article