Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 972697
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 16, 20262026-05-16T03:09:51+00:00 2026-05-16T03:09:51+00:00

I’m studying Elliptic Curve Cryptography. It seems like that; it is very hard to

  • 0

I’m studying “Elliptic Curve Cryptography”. It seems like that; it is very hard to understand the concept of “Identity Element”.

Actually my question is why we need “Identity Element”? As far as I understood, we need “Identity Element” in order to define inverse –P of any group element P.
Am I correct?

Moreover can somebody show me some introductory material on elliptic curve cryptography?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-16T03:09:51+00:00Added an answer on May 16, 2026 at 3:09 am

    A lot of cryptographic proofs rely on very general mathematical concepts about “sets of objects”. Some of these concepts are “groups” (Abelian Groups), “modules”, “fields” and “rings”. For these structured sets of objects a lot of lemmas and theorems have been derived and proofed in a very general way, once you accept the fundamental axioms as true which were used to construct them.

    These structures can be constructed. You need “Elements”, “Identity Elements”, “Inverse Elements” and “Operations” and some “Axioms” that are assumed as always true. (Like “Use operation XY, apply it to ELEMENT and INVERSE_ELEMENT and the result will always be IDENTITY_ELEMENT.”) So if you can verify about any set of objects that it fulfills the minimal pre-conditions for one of the abovely mentioned structures, then it will also fulfill all generally proven high level theorems.

    For Elliptic Curves you just proof all the basic ingredients (i.e. axiomatically defined properties) are there to make them an Abelian Group, and BANG!, you’ve prooven that all other theorems related to Abelian Groups are also true. One of the axiomatic pre-conditions for Abelian Groups is the “identity element”.


    I found this publication to be a very good introduction into Elliptic Curve cryptography, for people with some mathematical background. It comes with quite a few Java applets to play with online. Unfortunately it’s German only, but maybe that helps you anyway:

    http://www.warendorf-freckenhorst.de/elliptische-kurven/frame.html

    Another piece of software that lets you play with all sorts of cryptographic algorithms (including Elliptic Curves) is the now open sourced “CrypTool”, available in English, German and Spanish. It is suitable for anybody with interest in technical or IT things:

    https://www.cryptool.org/en/
    https://www.cryptool.org/en/ct1-download-en (Download)

    Here is a short introduction to CrypTool in the form of a presentation:

    http://www.cryptool.de/download/CrypToolPresentation-en.pdf

    Edit: Here is an English-language introduction into Elliptic Curve mathematics:
    http://www.certicom.com/index.php/ecc-tutorial

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

while studying some security things, there was a question that one can guess the
Studying C conversions I found a paragraph about Integer promotions that I haven't understand
While studying for a Functional Programming exam, I came across the following question from
While studying the Collection API, we find that some methods ( add , remove
i studying TDateTime functions and procedure, but not found something that allow me to
While studying for the SCJP 6 exam, I ran into this question in a
While studying the Qt framework, I've noticed that it's littered with hundreds of overloaded
I studying NSCharacterset class. NSString and NSCharacterset look like similar class. Who can explain
After studying the Perl require docs and other links like this on Stackoverflow I'm
I've been studying the Google authentication API (AuthSub)... My question is, how do I

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.