CRYPTO NEWS

How do I calculate number of multiplication, exponential, and pairing operations in a cryptographic algorithm (signcryption/unsigncryption)?

I have been working on signcryption scheme and its security proof. I want to compute the efficiency in terms of number of scalar multiplication operation, number of exponential operations, and number of bilinear pairing operation. I am comparing it with other schemes as well. I think I am missing out some information regarding point scalar multiplication and couldn’t figure how should I count the number of multiplication operation. For example if Usigncryption step in the figure below, I see only 2 multiplication operations U1=r1P2 and U2=r1QA. Is it correct?

Clay Vibes

#Clay Vibes #TheSupremeTeam Artist Name: Clay Vibes Who are you? Versatile, creative, hip hop inspired. I produce my beats, write my own lyrics and do my thing. Where are you from? Indiana, and there's a mix of just about everything here. People like what they like, however hip hop is what I'm really into. How::Listen

#Clay Vibes #TheSupremeTeam
Artist Name: Clay Vibes

Who are you?

Versatile, creative, hip hop inspired. I produce my beats, write my own lyrics and do my thing.

Where are you from?

Indiana, and there's a mix of just about everything here. People like what they like, however hip hop is what I'm really into.

How can we follow you?

Song Title: Too Comfortable

Listen to Clay Vibes:

Source: https://supremepr.us/

How do I calculate number of multiplication, exponential, and pairing operations in a cryptographic algorithm (signcryption/unsigncryption)?

Shopping cart
There are no products in the cart!
Continue shopping
0