Skip to main content
SpringerLink
Log in

Compression Point in Field of Characteristic 3

  • Conference paper
  • First Online:
Cryptography, Codes and Cyber Security (I4CS 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1747))

Included in the following conference series:

  • 142 Accesses

Abstract

For some applications, systems and devices, it might be desirable to take as few as possible of bit memory space and still keep the same result. Compression point is a new method that used some arithmetic operation in (ECC) elliptic curve cryptography to reduce memory space. If we take any point on the elliptic curve, we can see that this point is consisting of two coordinates x and y, so with compression point we can compressed this point and keep only one coordinate x or y and one sign bit/trit, requiring only half the space. In this paper, we will show new methods of compression point that can save \(25\%\) of the space memory in fields of characteristic 3, and compare it with previous result.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 203–209 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-39799-X_31

    Chapter  Google Scholar 

  3. Gashkov, S.B., Sergeev, I.S.: Complexity of computation in finite fields. J. Math. Sci. 191, 661–685 (2013). https://doi.org/10.1007/s10958-013-1350-5

    Article  MathSciNet  MATH  Google Scholar 

  4. Paulo, S.B., Voloch, J.F.: Efficient Computation of Roots in Finite Fields. Kluwer Academic Publishers, Amsterdam (2004)

    MATH  Google Scholar 

  5. Khabbazian, M., Gulliver, T., Bhargava, V.: Double point compression with applications to speeding up random point multiplication. IEEE Trans. Comput. 56(3), 305–313 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–369. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45708-9_23

    Chapter  Google Scholar 

  7. Duquesne, S., El Mrabet, N., Haloui, S., Rondepierre, F.: Choosing and generating parameters for pairing implementation on BN curves. Appl. Algebra Eng. Commun. Comput. 29(2), 113–147 (2017). https://doi.org/10.1007/s00200-017-0334-y

    Article  MathSciNet  MATH  Google Scholar 

  8. Justus, B.: Point compression and coordinate recovery for Edwards curves over finite field. Analele University de Vest, Timisoara Seria Matematica Informatica LII 2, 111–125 (2014)

    MathSciNet  MATH  Google Scholar 

  9. Gashkov, S.B., Gashkov, I.B.: Fast algorithm of square rooting in some finite fields of odd characteristic. Mosc. Univ. Math. Bull. 73(5), 176–181 (2018). https://doi.org/10.3103/S0027132218050029

    Article  MathSciNet  MATH  Google Scholar 

  10. King, B.: A point compression method for elliptic curves defined over GF(2n). In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 333–345. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24632-9_24

    Chapter  Google Scholar 

  11. Dudeanu, A., Oancea, G.R., Iftene, S.: An x-coordinate point compression method for elliptic curves over Fp. In: 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2010)

    Google Scholar 

  12. Iyengar, V.S.: Efficient characteristic 3 Galois field operations for elliptic curve cryptographic applications. In: Proceedings of the 10th International Conference on Security and Cryptography (SECRYPT-2013), pp. 531–536 (2013). ISBN: 978-989-8565-73-0

    Google Scholar 

  13. Galbraith, S.D., Lin, X.: Computing pairings using x-coordinates only. Des. Codes Cryptogr. 50, 305–324 (2009). https://doi.org/10.1007/s10623-008-9233-3

    Article  MathSciNet  MATH  Google Scholar 

  14. Faisal, Gazali, W.: An algorithm to find square root of quadratic residues over finite fields using primitive elements. In: 2nd International Conference on Computer Science and Computational Intelligence 2017, ICCSCI 2017, Bali, Indonesia, vol. 116, pp. 198–205, 13–14 October 2017. Procedia Computer Science (2017)

    Google Scholar 

  15. Brumley, B.B., Järvinen, K.U.: Fast point decompression for standard elliptic curves. In: Mjølsnes, S.F., Mauw, S., Katsikas, S.K. (eds.) EuroPKI 2008. LNCS, vol. 5057, pp. 134–149. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69485-4_10

    Chapter  Google Scholar 

  16. Koshelev, D.: New point compression method for elliptic Fq2-curves of j-invariant 0. Finite Fields Th. App. 69, 101774 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  17. Zhang, Y., Li, Y., Chen, Q.: Fast asymptotic square root for two types of special Pentanomials. IEEE Access 7, 50255–50264 (2019)

    Article  Google Scholar 

  18. Adj, G., Rodriguez-Henriquez, F.: Square root computation over even extension fields. IEEE Trans. Comput. 63, 2829–2841 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Sidi Mohammed Ben Abdellah FSDM (labo: LASMA), Fez, Morocco

    Ismail Assoujaa, Siham Ezzouak & Hakima Mouanis

Authors
  1. Ismail Assoujaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siham Ezzouak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hakima Mouanis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Ismail Assoujaa or Siham Ezzouak .

Editor information

Editors and Affiliations

  1. University of Caen Normandy, Caen, France

    Abderrahmane Nitaj

  2. ESAIP, Angers, France

    Karim Zkik

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Assoujaa, I., Ezzouak, S., Mouanis, H. (2022). Compression Point in Field of Characteristic 3. In: Nitaj, A., Zkik, K. (eds) Cryptography, Codes and Cyber Security. I4CS 2022. Communications in Computer and Information Science, vol 1747. Springer, Cham. https://doi.org/10.1007/978-3-031-23201-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-23201-5_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-23200-8

  • Online ISBN: 978-3-031-23201-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation