Asymmetric Cryptographic Algorithms

Authors:
I. N. Kovalenko;A. I. Kochubinskii
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine storm@unl.ac.uk;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine dyna@ukrpack.net
Venue:
Cybernetics and Systems Analysis
Year:
2003

Citing 5
Cited 3

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Discrete logarithms in GF(P) using the number field sieve

SIAM Journal on Discrete Mathematics
A new signature scheme based on the DSA giving message recovery

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Efficient Identification and Signatures for Smart Cards

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology

I. N. Kovalenko's Scientific Works

Cybernetics and Systems Analysis
Standardization in information security management

Cybernetics and Systems Analysis
A review of my scientific publications. Masters and coworkers

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of asymmetric cryptographic algorithms introduced by W. Diffie and M. Hellman in 1976 is considered. The problems of factorization of large integers and finding discrete logarithms for elements of finite large-order groups are presented. It is proved that asymmetric cryptographic algorithms based on the problem of finding a discrete logarithm for points of an elliptic curve over a finite field should be used in modern information technology.