Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-49649-1_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Evidence That XTR Is More Secure Than Supersingular Elliptic Curve Cryptosystems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Elliptic Curve Cryptosystems

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1987English

Faster Attacks on Elliptic Curve Cryptosystems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Efficient Countermeasures Against Power Analysis for Elliptic Curve Cryptosystems

Smart Card Research and Advanced Applications VI
2004English

Construction of Pseudorandom Binary Lattices Using Elliptic Curves

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2011English

Resistance Against Differential Power Analysis for Elliptic Curve Cryptosystems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Towards Quantum-Resistant Cryptosystems From Supersingular Elliptic Curve Isogenies

Journal of Mathematical Cryptology
Computational MathematicsApplied MathematicsComputer Science Applications
2014English

CM-Droid: Secure Container for Android Password Misuse Vulnerability

Computers, Materials and Continua
Mechanics of MaterialsElectronic EngineeringSimulationComputer Science ApplicationsElectricalModelingBiomaterials
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy