Elliptic curve cryptography
D Hankerson, A Menezes - Encyclopedia of Cryptography, Security and …, 2021 - Springer
Background Elliptic curve cryptographic schemes were proposed independently in 1985 by
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …
[图书][B] Cryptography: theory and practice
DR Stinson - 2005 - api.taylorfrancis.com
THE LEGACYFirst introduced in 1995, Cryptography: Theory and Practice garnered
enormous praise and popularity, and soon became the standard textbook for cryptography …
enormous praise and popularity, and soon became the standard textbook for cryptography …
Теоретико-числовые алгоритмы в криптографии
ЕР Данилкова - ШКОЛА МОЛОДЫХ УЧЕНЫХ, 2021 - elibrary.ru
В статье рассмотрены некоторые элементы теории чисел и показано, как они
используются в современной криптографии. В качестве примеров выбраны наиболее …
используются в современной криптографии. В качестве примеров выбраны наиболее …
Implementing cryptographic pairings on smartcards
M Scott, N Costigan, W Abdulwahab - International Workshop on …, 2006 - Springer
Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment
in new security applications, particularly in the context of implementations of Identity-Based …
in new security applications, particularly in the context of implementations of Identity-Based …
Improved masking for tweakable blockciphers with applications to authenticated encryption
A popular approach to tweakable blockcipher design is via masking, where a certain
primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute …
primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute …
Unbelievable Security Matching AES Security Using Public Key Systems
AK Lenstra - International Conference on the Theory and …, 2001 - Springer
Abstract The Advanced Encryption Standard (AES) provides three levels of security: 128,
192, and 256 bits. Given a desired level of security for the AES, this paper discusses …
192, and 256 bits. Given a desired level of security for the AES, this paper discusses …
[PDF][PDF] Handbook of Magma functions
J Cannon, W Bosma, C Fieker, A Steel - Edition, 2006 - academia.edu
HANDBOOK OF MAGMA FUNCTIONS Page 1 HANDBOOK OF MAGMA FUNCTIONS Volume
10 Incidence Structures, Codes and Cryptography John Cannon Wieb Bosma Editors Version …
10 Incidence Structures, Codes and Cryptography John Cannon Wieb Bosma Editors Version …
[PDF][PDF] Data encryption standard (DES)
A Biryukov, C De Cannière - Encyclopedia of cryptography and security, 2011 - orbilu.uni.lu
The Data Encryption Standard (DES)[31] has been around for more than 25 years. During
this time the standard was revised three times: as FIPS-46-1 in 1988, as FIPS-46-2 in 1993 …
this time the standard was revised three times: as FIPS-46-1 in 1988, as FIPS-46-2 in 1993 …
A comparison of MNT curves and supersingular curves
We compare both the security and performance issues related to the choice of MNT curves
against supersingular curves in characteristic three, for pairing based systems. We pay …
against supersingular curves in characteristic three, for pairing based systems. We pay …
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
E Thomé - Journal of symbolic computation, 2002 - Elsevier
This paper describes a new algorithm for computing linear generators (vector generating
polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in …
polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in …