Academic literature on the topic 'ECC over finite fields'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'ECC over finite fields.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "ECC over finite fields"

1

Jimoh, R. G., M. AbdulRaheem, I. R. Salimonu, and O. V. Mejabi. "Elliptic Curve Cryptosystem in securing Communication across Unsecure Channel." Circulation in Computer Science 2, no. 5 (2017): 7–12. http://dx.doi.org/10.22632/ccs-2017-251-97.

Full text
Abstract:
In the present day, exchanging information is the essential of successful business in our society. Securing the information from unauthorized individuals as well as unauthorized access is more essential. Cases of hacking bank accounts, stealing credit card numbers and decoding secret information are common occurrence. With the rapid grow of internet technology and increasing computational power of computer, securing privilege information against unauthorized access is a source of concern to the business managers. Different organisation use different methods to secure sensitive information. Mos
APA, Harvard, Vancouver, ISO, and other styles
2

Huque, Md Sirajul, Sk Bhadar Saheb, and Jayaram Boga. "An Approach to Secure Data Aggregation in Wireless Sensor Networks (WSN) using Asymmetric Homomorphic Encryption (Elliptic Curve Cryptography) Scheme." International Journal of Advanced Research in Computer Science and Software Engineering 7, no. 7 (2017): 263. http://dx.doi.org/10.23956/ijarcsse/v7i7/0162.

Full text
Abstract:
Wireless sensor networks (WSN) are a collection of autonomous collection of motes. Sensor motes are usually Low computational and low powered. In WSN Sensor motes are used to collect environmental data collection and pass that data to the base station. Data aggregation is a common technique widely used in wireless sensor networks. [2] Data aggregation is the process of collecting the data from multiple sensor nodes by avoiding the redundant data transmission and that collected data has been sent to the base station (BS) in single route. Secured data aggregation deals with Securing aggregated d
APA, Harvard, Vancouver, ISO, and other styles
3

Morales-Sandoval, Miguel, Luis Armando Rodriguez Flores, Rene Cumplido, Jose Juan Garcia-Hernandez, Claudia Feregrino, and Ignacio Algredo. "A Compact FPGA-Based Accelerator for Curve-Based Cryptography in Wireless Sensor Networks." Journal of Sensors 2021 (January 6, 2021): 1–13. http://dx.doi.org/10.1155/2021/8860413.

Full text
Abstract:
The main topic of this paper is low-cost public key cryptography in wireless sensor nodes. Security in embedded systems, for example, in sensor nodes based on field programmable gate array (FPGA), demands low cost but still efficient solutions. Sensor nodes are key elements in the Internet of Things paradigm, and their security is a crucial requirement for critical applications in sectors such as military, health, and industry. To address these security requirements under the restrictions imposed by the available computing resources of sensor nodes, this paper presents a low-area FPGA-prototyp
APA, Harvard, Vancouver, ISO, and other styles
4

SIAP, IRFAN, HASAN AKIN, and MEHMET E. KOROGLU. "REVERSIBLE CELLULAR AUTOMATA WITH PENTA-CYCLIC RULE AND ECCs." International Journal of Modern Physics C 23, no. 10 (2012): 1250066. http://dx.doi.org/10.1142/s0129183112500660.

Full text
Abstract:
The reversibility problem for linear cellular automata with null boundary defined by a rule matrix in the form of a pentadiagonal matrix was studied over the binary field ℤ2 by Martín del Rey et al. [Appl. Math. Comput.217, 8360 (2011)]. Recently, the reversibility problem of 1D Cellular automata with periodic boundary has been extended to ternary fields and further to finite primitive fields ℤp by Cinkir et al. [J. Stat. Phys.143, 807 (2011)]. In this work, we restudy some of the work done in Cinkir et al. [J. Stat. Phys.143, 807 (2011)] by using a different approach which is based on the the
APA, Harvard, Vancouver, ISO, and other styles
5

Chang, Hung Wei, Che Wun Chiou, Wen Yew Liang, and Jenq Haur Wang. "Full Multiplexers Implementation of Dual Basis Multiplier over GF(2m)." Applied Mechanics and Materials 284-287 (January 2013): 3423–27. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.3423.

Full text
Abstract:
Information security is getting more important due to the highly-developed computer technologies. The information security is heavily dependent on cryptosystems such as RSA and elliptic curve cryptosystem (ECC). ECC is suitable for the resource-constrained devices such as embedded system or hand-held devices because ECC can achieve the same security level but uses less cost as compared to RSA. Galois/Finite field multiplication is the most crucial operation in ECC. There are three popular bases in finite field in GF(2m), polynomial basis (PB), normal basis (NB), and dual basis (DB). A low-comp
APA, Harvard, Vancouver, ISO, and other styles
6

Parshall, Hans. "Simplices over finite fields." Proceedings of the American Mathematical Society 145, no. 6 (2017): 2323–34. http://dx.doi.org/10.1090/proc/13493.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Purohit, G. N., and Asmita Singh Rawat. "Efficient Implementation of Arithmetic Operations in ECC over Binary Fields." International Journal of Computer Applications 6, no. 2 (2010): 5–9. http://dx.doi.org/10.5120/1056-1376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Esnault, Hélène. "Coniveau over -adic fields and points over finite fields." Comptes Rendus Mathematique 345, no. 2 (2007): 73–76. http://dx.doi.org/10.1016/j.crma.2007.05.017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Angel, Jeff. "Finite Upper Half Planes over Finite Fields." Finite Fields and Their Applications 2, no. 1 (1996): 62–86. http://dx.doi.org/10.1006/ffta.1996.0005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wamelen, Paul van. "Jacobi sums over finite fields." Acta Arithmetica 102, no. 1 (2002): 1–20. http://dx.doi.org/10.4064/aa102-1-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "ECC over finite fields"

1

Kultinov, Kirill. "Software Implementations and Applications of Elliptic Curve Cryptography." Wright State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1559232475298514.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abu-Mahfouz, Adnan Mohammed. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices." Diss., University of Pretoria, 2004. http://hdl.handle.net/2263/25330.

Full text
Abstract:
Data security will play a central role in the design of future IT systems. The PC has been a major driver of the digital economy. Recently, there has been a shift towards IT applications realized as embedded systems, because they have proved to be good solutions for many applications, especially those which require data processing in real time. Examples include security for wireless phones, wireless computing, pay-TV, and copy protection schemes for audio/video consumer products and digital cinemas. Most of these embedded applications will be wireless, which makes the communication channel vul
APA, Harvard, Vancouver, ISO, and other styles
3

Voloch, J. F. "Curves over finite fields." Thesis, University of Cambridge, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rovi, Carmen. "Algebraic Curves over Finite Fields." Thesis, Linköping University, Department of Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56761.

Full text
Abstract:
<p>This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Since Goppa's construction of algebraic geometric codes, there has been great interest in finding curves with many rational points. Here we explain the main tools for finding rational points on a curve over a nite eld and provide the necessary background on ring and field theory. Four different articles are analyzed, the first of these articles gives a complete set of table showing the numbers of rational points for curves with genus up to 50. The other articles provide interesting constructions
APA, Harvard, Vancouver, ISO, and other styles
5

Lockard, Shannon Renee. "Random vectors over finite fields." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1181251515/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Giuzzi, Luca. "Hermitian varieties over finite fields." Thesis, University of Sussex, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326913.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sharkey, Andrew. "Random polynomials over finite fields." Thesis, University of Glasgow, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299963.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Park, Jang-Woo. "Discrete dynamics over finite fields." Connect to this title online, 2009. http://etd.lib.clemson.edu/documents/1252937730/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cooley, Jenny. "Cubic surfaces over finite fields." Thesis, University of Warwick, 2014. http://wrap.warwick.ac.uk/66304/.

Full text
Abstract:
It is well-known that the set of rational points on an elliptic curve forms an abelian group. When the curve is given as a plane cubic in Weierstrass form the group operation is defined via tangent and secant operations. Let S be a smooth cubic surface over a field K. Again one can define tangent and secant operations on S. These do not give S(K) a group structure, but one can still ask for the size of a minimal generating set. In Chapter 2 of the thesis I show that if S is a smooth cubic surface over a field K with at least 4 elements, and if S contains a skew pair of lines defined over K, th
APA, Harvard, Vancouver, ISO, and other styles
10

Lotter, Ernest Christiaan. "On towers of function fields over finite fields." Thesis, Stellenbosch : University of Stellenbosch, 2007. http://hdl.handle.net/10019.1/1283.

Full text
Abstract:
Thesis (PhD (Mathematical Sciences))--University of Stellenbosch, 2007.<br>Explicit towers of algebraic function fields over finite fields are studied by considering their ramification behaviour and complete splitting. While the majority of towers in the literature are recursively defined by a single defining equation in variable separated form at each step, we consider towers which may have different defining equations at each step and with arbitrary defining polynomials. The ramification and completely splitting loci are analysed by directed graphs with irreducible polynomials as vert
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "ECC over finite fields"

1

Moreno, Carlos J. Algebraic curves over finite fields. Cambridge University Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Projective geometries over finite fields. 2nd ed. Clarendon Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jacobson, Nathan. Finite-dimensional division algebras over fields. Springer, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dmitri, Kaledin, and Tschinkel Yuri, eds. Higher-dimensional geometry over finite fields. IOS Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jacobson, Nathan. Finite-Dimensional Division Algebras over Fields. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-02429-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fried, Michael D., ed. Applications of Curves over Finite Fields. American Mathematical Society, 1999. http://dx.doi.org/10.1090/conm/245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Noriko, Yui, ed. Arithmetic of diagonal hypersurfaces over finite fields. Cambridge University Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hansen, Søren Have. Rational points on curves over finite fields. Aarhus Universitet, Matematisk Institut, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alam, Shajahan. Zeta-functions of curves over finite fields. UMIST, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

A, Huang Ming-Deh, ed. Primality testing and Abelian varieties over finite fields. Springer-Verlag, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "ECC over finite fields"

1

Hassan, Mohamed N., and Mohammed Benaissa. "Efficient Time-Area Scalable ECC Processor Using μ-Coding Technique." In Arithmetic of Finite Fields. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13797-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zippel, Richard. "Factoring over Finite Fields." In Effective Polynomial Computation. Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3188-3_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tsfasman, Michael, Serge Vlǎduţ, and Dmitry Nogin. "Curves over finite fields." In Mathematical Surveys and Monographs. American Mathematical Society, 2007. http://dx.doi.org/10.1090/surv/139/03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hachenberger, Dirk, and Dieter Jungnickel. "Matrices Over Finite Fields." In Topics in Galois Fields. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60806-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chahal, J. S. "Equations over Finite Fields." In Topics in Number Theory. Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-0439-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Stix, Jakob. "Sections over Finite Fields." In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30674-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rosen, Michael. "Polynomials over Finite Fields." In Graduate Texts in Mathematics. Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4757-6046-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mignotte, Maurice. "Polynomials Over Finite Fields." In Mathematics for Computer Algebra. Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4613-9171-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ireland, Kenneth, and Michael Rosen. "Equations over Finite Fields." In A Classical Introduction to Modern Number Theory. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4757-2103-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gutch, Harold W., Peter Gruber, and Fabian J. Theis. "ICA over Finite Fields." In Latent Variable Analysis and Signal Separation. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15995-4_80.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "ECC over finite fields"

1

Reger, J., and K. Schmidt. "Aspects on analysis and synthesis of linear discrete systems over the finite field Fq." In 2003 European Control Conference (ECC). IEEE, 2003. http://dx.doi.org/10.23919/ecc.2003.7085191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Shengli, Soung Chang Liew, and Lu Lu. "Physical Layer Network Coding Schemes over Finite and Infinite Fields." In IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference. IEEE, 2008. http://dx.doi.org/10.1109/glocom.2008.ecp.726.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wildberger, N. J. "Neuberg cubics over finite fields." In Proceedings of the First SAGA Conference. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812793430_0027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Draper, Stark C., and Sheida Malekpour. "Compressed sensing over finite fields." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205666.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tan, Vincent Y. F., Laura Balzano, and Stark C. Draper. "Rank minimization over finite fields." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6033722.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

von zur Gathen, Joachim. "Irreducible trinomials over finite fields." In the 2001 international symposium. ACM Press, 2001. http://dx.doi.org/10.1145/384101.384146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ronyai, Lajos. "Factoring polynomials over finite fields." In 28th Annual Symposium on Foundations of Computer Science. IEEE, 1987. http://dx.doi.org/10.1109/sfcs.1987.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Moon Ho, and Yuri L. Borissov. "On Jacket transforms over finite fields." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205783.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bioglio, V., T. Bianchi, and E. Magli. "Secure compressed sensing over finite fields." In 2014 IEEE International Workshop on Information Forensics and Security (WIFS). IEEE, 2014. http://dx.doi.org/10.1109/wifs.2014.7084326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bettale, Luk, Jean-Charles Faugère, and Ludovic Perret. "Solving polynomial systems over finite fields." In the 37th International Symposium. ACM Press, 2012. http://dx.doi.org/10.1145/2442829.2442843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!