Baby-step-giant-step algorithm in functional encryption

The Shanks&rsquo; baby-step-giant step (BSGS) algorithm is the final stage of certain functional encryption schemes based on elliptic curve pairings. This article discusses how the application of BSGS in these schemes differs from the classical one. Boundaries The textbook implementations use the group&rsquo;s order $q$ as an input parameter. However, it would make the functional encryption scheme…