Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,719 papers from all fields of science
Search
Sign In
Create Free Account
XTR
In cryptography, XTR is an algorithm for public-key encryption. XTR stands for ‘ECSTR’, which is an abbreviation for Efficient and Compact Subgroup…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Alice and Bob
Arjen Lenstra
Cryptography
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Efficient scheme of verifying integrity of application binaries in embedded operating systems
Soon-Seok Kim
,
Deok-Gyu Lee
,
J. Park
Journal of Supercomputing
2010
Corpus ID: 18353795
Currently, embedded systems have been widely used for ubiquitous computing environments including digital setup boxes, mobile…
Expand
2008
2008
An Analysis of the Vector Decomposition Problem
S. Galbraith
,
E. Verheul
International Conference on Theory and Practice…
2008
Corpus ID: 714288
The vector decomposition problem (VDP) has been proposed as a computational problem on which to base the security of public key…
Expand
2006
2006
Faster and smaller hardware implementation of XTR
M. Neve
,
Eric Peeters
,
Guerric Meurice de Dormale
,
J. Quisquater
SPIE Optics + Photonics
2006
Corpus ID: 14495878
Modular multiplication is the core of most Public Key Cryptosystems and therefore its implementation plays a crucial role in the…
Expand
2004
2004
A Comparison of CEILIDH and XTR
R. Granger
,
D. Page
,
Martijn Stam
International Workshop on Ant Colony Optimization…
2004
Corpus ID: 2678125
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR…
Expand
Highly Cited
2002
Highly Cited
2002
Toward Hierarchical Identity-Based Encryption
J. Horwitz
,
Ben Lynn
International Conference on the Theory and…
2002
Corpus ID: 3208921
We introduce the concept of hierarchical identity-based encryption (HIBE) schemes, give precise definitions of their security and…
Expand
2002
2002
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
W. Li
,
M. Näslund
,
I. Shparlinski
Annual International Cryptology Conference
2002
Corpus ID: 5816624
We consider a certain generalization of the hidden number problem introduced by Boneh and Venkatesan in 1996. Considering the XTR…
Expand
Review
2001
Review
2001
Speeding Up XTR
Martijn Stam
,
A. Lenstra
International Conference on the Theory and…
2001
Corpus ID: 2978583
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single…
Expand
Review
2001
Review
2001
An overview of the XTR public key system
A. Lenstra
,
E. Verheul
2001
Corpus ID: 17008289
XTR is a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR in…
Expand
Highly Cited
2000
Highly Cited
2000
The XTR Public Key System
A. Lenstra
,
E. Verheul
Annual International Cryptology Conference
2000
Corpus ID: 13860258
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a…
Expand
Highly Cited
1999
Highly Cited
1999
A critical assessment of the truly Meshless Local Petrov-Galerkin (MLPG), and Local Boundary Integral Equation (LBIE) methods
S. Atluri
,
Hyun Gyu Kim
,
J. Cho
1999
Corpus ID: 3683044
Abstract The essential features of the Meshless Local Petrov-Galerkin (MLPG) method, and of the Local Boundary Integral Equation…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE