3 resultados para Cryptography, Discrete Logarithm, Extension Fields, Karatsuba Multiplication, Normal Basis
em DigitalCommons@University of Nebraska - Lincoln
Resumo:
The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.
Resumo:
This study compares information-seeking behavior of Bachelor of Science and Master of Science students in the fields of agricultural extension and education. The authors surveyed Iranian students in departments of agricultural extension and education at four universities in Tehran, Shiraz, Mollasani, and Kermanshah. This study focused on three aspects: (1) comparison of amounts of information-seeking behavior between Bachelor of Science and Master of Science agricultural extension and education students; (2) comparison of information-seeking behavior varieties in Bachelor of Science and Master of Science agricultural extension and education students; (3) Comparison of amounts of available information resources at four universities and its effectiveness on students' information-seeking behavior; and (4) comparison of research and educational outputs in Bachelor of Science and Master of Science students. Scale free technique, division by mean method, principal components analysis technique, Delphi method, t-test, correlation and regression tools were used for data analysis. This study revealed that Bachelor of Science students' information-seeking behavior is for improving educational output, but Master of Science students' information-seeking behavior is for promoting research output. Among varieties of Internet searching skills, library searching skills, and awareness of library information-seeking methods with students' information-seeking behavior, there are not significant differences between two groups of students.
Resumo:
Topics include: Free groups and presentations; Automorphism groups; Semidirect products; Classification of groups of small order; Normal series: composition, derived, and solvable series; Algebraic field extensions, splitting fields, algebraic closures; Separable algebraic extensions, the Primitive Element Theorem; Inseparability, purely inseparable extensions; Finite fields; Cyclotomic field extensions; Galois theory; Norm and trace maps of an algebraic field extension; Solvability by radicals, Galois' theorem; Transcendence degree; Rings and modules: Examples and basic properties; Exact sequences, split short exact sequences; Free modules, projective modules; Localization of (commutative) rings and modules; The prime spectrum of a ring; Nakayama's lemma; Basic category theory; The Hom functors; Tensor products, adjointness; Left/right Noetherian and Artinian modules; Composition series, the Jordan-Holder Theorem; Semisimple rings; The Artin-Wedderburn Theorem; The Density Theorem; The Jacobson radical; Artinian rings; von Neumann regular rings; Wedderburn's theorem on finite division rings; Group representations, character theory; Integral ring extensions; Burnside's paqb Theorem; Injective modules.