human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Batch Verification of EdDSA Signatures"
  Abstract: In AfricaCrypt 2012 and ACNS 2014, several algorithms are proposed for the batch verification of ECDSA signatures. In this paper, we make a comparative study of these methods for the Edwards curve digital signature algorithm (EdDSA). We describe the adaptation of Algorithms N, N′, S2′ and SP for EdDSA signatures. The randomization methods are also explained in detail. More precisely, we study seminumeric scalar multiplication and Montgomery ladders during randomization of EdDSA signatures. Each EdDSA signature verification involves a square-root computation. One may instead use an ECDSA-like verification procedure which avoids the expensive square-root computation. We study both these variants of EdDSA verification. Experimental results show that for small batch sizes the Algorithms S2′ and SP yield speedup comparable to what is achieved by Algorithm N′ which is originally proposed as the default EdDSA batch-verification algorithm.

Connected through hyperedge HE-1 (induced by source paper "A unified approach to deterministic encryption: new constructions and a connection to computational entropy"):
  with members:
    - "Dual projective hashing and its applications -- lossy trapdoor functions and more"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Engineering