Efficient Algorithm for Tate Pairing of Composite Order.
Yutaro KiyomuraTsuyoshi TakagiPublished in: IWSEC (2013)
Keyphrases
- single pass
- dynamic programming
- learning algorithm
- high efficiency
- tree structure
- computationally efficient
- computational cost
- significant improvement
- preprocessing
- experimental evaluation
- search space
- times faster
- cost function
- computationally intensive
- computational complexity
- expectation maximization
- improved algorithm
- objective function
- data sets
- estimation algorithm
- face recognition
- highly efficient
- recognition algorithm
- similarity measure
- optimization algorithm
- segmentation algorithm
- linear programming
- high accuracy
- worst case
- np hard
- artificial neural networks