- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

**"Functions based on GF(p)"**. How are these different from the subsection of "Arithmetic of the Group of Elliptic Curve Points" called

**"Functions for the Elliptic Curve over GF(p)"**?

From what I can tell, the functions are all the same with the exception that the former works with IppsBigNumState contexts, while the latter works with IppsGFPElement contexts. Is this the only difference? I haven't experimented with them yet, but I was wondering if one set of functions would be faster than the other? Can anyone offer some insight?

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

Andrzej, Thanks you for the explanation. I add some comments from IPP developer.

Right, their basic functionalityare the same because of both represent the same math group.

The less formal difference is the following:

-ECCP"Functions based on GF(p)" areover prime field only

-**GFp**EC supports EC over prime GF(p) as well as over it extensions GF(p^m) and its tower extensions.

The key problem isthat ECCP*was designedforpublic cryptographic functions, such asthe functionalityis enhanced (signing/verifying, DH support)whilethe **GFp**ECwas designed forinternal product and we planed to dropp them in the future release.

So I'd like tosuggest you touse the first one ECCp(based on BN). and ignore the seond oneas **GFp**ECwill not be supported in the future IPP versions.

Best Regards,

Ying

Link Copied

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

You can compare the example from section 17.5

and the second example from section 21.3

of our guide

http://software.intel.com/en-us/articles/ipp-crypto-guide/

(you can easily modify one of these examples to obtain the same curve

and check the efficiency)

Notice that

only in ECCP* functions (based on BigNums) you can find such cryptographic

functions as digital signature or Diffie-Hellman scheme.

in GFPEC* (based on GF(p)) you have only arithmetic -no cryptographic functions

Source codes in GFPEC* case look more complicated but it is possible

to consider for example the extension fields G(p^m) in an analogous manner (impossible in ECCP* aopproach)

Andrzej Chrzeszczyk

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

Andrzej, Thanks you for the explanation. I add some comments from IPP developer.

Right, their basic functionalityare the same because of both represent the same math group.

The less formal difference is the following:

-ECCP"Functions based on GF(p)" areover prime field only

-**GFp**EC supports EC over prime GF(p) as well as over it extensions GF(p^m) and its tower extensions.

The key problem isthat ECCP*was designedforpublic cryptographic functions, such asthe functionalityis enhanced (signing/verifying, DH support)whilethe **GFp**ECwas designed forinternal product and we planed to dropp them in the future release.

So I'd like tosuggest you touse the first one ECCp(based on BN). and ignore the seond oneas **GFp**ECwill not be supported in the future IPP versions.

Best Regards,

Ying

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

Thanks again for that great guide; it's saved me a lot of headaches getting things up and running, and I still refer to it whenever I get stuck.

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page