Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie
Hi there,
There is an issue with role permissions that is being worked on at the moment.
If you are having trouble with access or permissions on regional forums please post here to get access: https://www.boards.ie/discussion/2058365403/you-do-not-have-permission-for-that#latest

Finite field division

  • 20-04-2008 8:03pm
    #1
    Closed Accounts Posts: 12,382 ✭✭✭✭


    Hello

    I was wondering if anyone could help me with finite field division?

    The example I am looking at is this -

    Calculations in the field F23

    (83) / 7 mod 23 // note: (83) is 8 cubed
    = 512 / 7 mod 23
    = 6 * 7-1 mod 23 // note: 7-1 is the inverse of 7
    = 6 * 10 mod 23
    = 14.

    I can understand why 7 becomes the inverse of 7, as multiplying by the inverse is the same as dividing by the non-inverse, but why does 512 become 6??

    Any help appreciated.

    Thanks.


Comments

  • Registered Users, Registered Users 2 Posts: 16 Renny Barrett


    512 is congruent to 6 mod 23.


  • Closed Accounts Posts: 12,382 ✭✭✭✭AARRRGH


    Thank you for your answer!

    Does this mean:

    512 mod 23 = 6
    6 mod 23 = 6

    so both statements are equivalent?

    In the above example, do I have to reduce 512 to 6?

    Also, is there an easy way to find out if two numbers are congruent?

    Thank you!


  • Closed Accounts Posts: 6,081 ✭✭✭LeixlipRed


    Two numbers (r,s) are congruent mod m if you they have the same remainder mod m. Or equivalently, r-s is congruent to 0(mod m). So in your example above. 512 minus 6 equals 506 which has remainder 0 when divided by 23. ie they're congruent


  • Closed Accounts Posts: 12,382 ✭✭✭✭AARRRGH


    Got it, thank you! :)


Advertisement