NPS logo Naval Postgraduate School
Dudley Knox Library
        View Item 
        •   Calhoun Home
        • Theses and Dissertations
        • 1. Thesis and Dissertation Collection, all items
        • View Item
        •   Calhoun Home
        • Theses and Dissertations
        • 1. Thesis and Dissertation Collection, all items
        • View Item
        • How to search in Calhoun
        • My Accounts
        • Ask a Librarian
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of CalhounCollectionsThis Collection

        My Account

        LoginRegister

        Statistics

        Most Popular ItemsStatistics by CountryMost Popular Authors

        Pascal polynomials over GF(2)

        Thumbnail
        View/Open
        Icon08Jun_Fernandez.pdf (356.6Kb)
        Download Record
        Download to EndNote/RefMan (RIS)
        Download to BibTex
        Author
        Fernandez, Carlos K.
        Date
        2008-06
        Advisor
        Fredricksen, Harold M.
        Stanica, Pantelimon
        Metadata
        Show full item record
        Abstract
        The Discrete Logarithm Problem (DLP) is a fundamental cryptographic primitive. The DLP is defined for any cyclic group, specifically finite fields, whether the integers modulo a prime p or a polynomial field of characteristic p modulo some irreducible polynomial f(x). For polynomial fields over a finite field, also known as Galois fields, the DLP can be viewed as finding a solution to the equation 1 + x(i) = x(j) for arbitrary values of i (modulo some primitive polynomial). Solutions are (relatively) easy to find for trinomials and these would be the easiest polynomials to implement in hardware. However, primitive trinomials do not exist for all degrees. Primitive polynomials are irreducible polynomials with an associated primitive root alpha that is a generator of the multiplicative group. Thus the generator alpha generates all nonzero 2(n) - 1 elements of a Galois field whose base field is the integers modulo two. Primitive polynomials over the field of two elements, or GF(2), have important applications in cryptology and coding theory. This thesis investigates properties of polynomials with more than three terms where all but one term is a row of Pascal's triangle modulo two. In other words we define a certain class of polynomials by f(x) + x(n) + p(x) is a row of Pascal's triangle modulo two. This thesis shows that some of these polynomials, which are not trinomials, also have "easy" solutions. We observe that for a polynomial to have an associated primitive element, there are definite restrictions on the degree of the polynomial using particular rows of Pascal's triangle.
        URI
        http://hdl.handle.net/10945/4065
        Collections
        • 1. Thesis and Dissertation Collection, all items

        Related items

        Showing items related by title, author, creator and subject.

        • Thumbnail

          Exploring fields with shift registers 

          Radowicz, Jody L. (Monterey, California. Naval Postgraduate School, 2006-09);
          The S-Boxes used in the AES algorithm are generated by field extensions of the Galois field over two elements, called GF(2). Therefore, understanding the field extensions provides a method of analysis, potentially efficient ...
        • Thumbnail

          Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions 

          Canright, David; Chung, Jong H.; Stănică, Pantelimon (Elsevier, 2015);
          The goal of this paper is two-fold. We first focus on the problem of deciding whether two monomial rotation symmetric (MRS) Boolean functions are affine equivalent via a permutation. Using a correspondence between such ...
        • Thumbnail

          A journey through Galois groups, irreducible polynomials and diophatine equations 

          Filaseta, M.; Luca, F.; Stănică, P.; Underwood, R.G. (2017);
          Computing the Galois group of the splitting field of a given polynomial with integer coefficients over the rationals is a classical problem in modern algebra. A theorem of Van der Waerden [Wae] asserts that almost all ...
        Feedback

        411 Dyer Rd. Bldg. 339
        Monterey, CA 93943

         

        circdesk@nps.edu
        (831) 656-2947
        DSN 756-2947

        Start Your Research

        • Research Guides
        • How to Cite
        • Search Basics
        • Ask a Librarian
        • Library Liaisons
        • Graduate Writing Center
        • Thesis Processing Office
        • Statistics, Maps & More
        • Copyright at NPS

        Find & Download

        • Databases List
        • Articles, Books & More
        • NPS Theses
        • NPS Faculty Publications: Calhoun
        • Journal Titles
        • Course Reserves

        Use the Library

        • My Accounts
        • Request Article or Book
        • Borrow, Renew, Return
        • Remote Access
        • Workshops & Tours
        • For Faculty & Researchers
        • For International Students
        • For Alumni
        • Print, Copy, Scan, Fax
        • Rooms & Study Spaces
        • Floor Map
        • Computers & Software
        • Adapters, Lockers & More

        Collections

        • NPS Archive: Calhoun
        • Restricted Resources
        • Special Collections & Archives
        • Federal Depository
        • Homeland Security Digital Library

        About

        • Hours
        • Library Staff
        • About Us
        • Visit Us

        NPS-Licensed Resources - Terms & Conditions

        Copyright Notice

         
         

          Federal Depository Library  

        NPS Home Privacy Policy Copyright Accessibility Contact Webmaster