Skip to search formSkip to main contentSkip to account menu

XTR

In cryptography, XTR is an algorithm for public-key encryption. XTR stands for ‘ECSTR’, which is an abbreviation for Efficient and Compact Subgroup… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Currently, embedded systems have been widely used for ubiquitous computing environments including digital setup boxes, mobile… 
2008
2008
The vector decomposition problem (VDP) has been proposed as a computational problem on which to base the security of public key… 
2006
2006
Modular multiplication is the core of most Public Key Cryptosystems and therefore its implementation plays a crucial role in the… 
2004
2004
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR… 
Highly Cited
2002
Highly Cited
2002
We introduce the concept of hierarchical identity-based encryption (HIBE) schemes, give precise definitions of their security and… 
2002
2002
We consider a certain generalization of the hidden number problem introduced by Boneh and Venkatesan in 1996. Considering the XTR… 
Review
2001
Review
2001
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single… 
Review
2001
Review
2001
XTR is a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR in… 
Highly Cited
2000
Highly Cited
2000
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a… 
Highly Cited
1999
Highly Cited
1999
Abstract The essential features of the Meshless Local Petrov-Galerkin (MLPG) method, and of the Local Boundary Integral Equation…