Por favor, use este identificador para citar o enlazar este ítem:
http://inaoe.repositorioinstitucional.mx/jspui/handle/1009/1400| A single formula and its implementation in FPGA for elliptic curve point addition using affine representation | |
| MIGUEL MORALES SANDOVAL CLAUDIA FEREGRINO URIBE RENE ARMANDO CUMPLIDO PARRA IGNACIO ALGREDO BADILLO | |
| Acceso Abierto | |
| Atribución-NoComercial-SinDerivadas | |
| Elliptic curve cryptography Point addition Hardware architecture Affine coordinates | |
| A formula for point addition in elliptic curves using a±ne representation and its implementation in FPGA is presented. The use of this new formula in hardware implementations of scalar multiplications for elliptic curve cryptography has the main advantages of: (i) reducing area for the implementations of elliptic curve point addition, and (ii) increasing the resistance to side channel attacks of the hardware implementation itself. Hardware implementation of scalar multiplication for elliptic curve cryptography using this new formulation requires low area resources while keeping high performance compared to implementations using projective coordinates, which are usually considered faster than the a±ne coordinates. | |
| World Scientific Publishing Company | |
| 2010 | |
| Artículo | |
| Inglés | |
| Estudiantes Investigadores Público en general | |
| Morales-Sandoval, M., et al., (2010). A single formula and its implementation in FPGA for elliptic curve point addition using affine representation, Journal of Circuits, Systems, and Computers, Vol. 19, (2): 425-433 | |
| CIENCIA DE LOS ORDENADORES | |
| Versión aceptada | |
| acceptedVersion - Versión aceptada | |
| Aparece en las colecciones: | Artículos de Ciencias Computacionales |
Cargar archivos:
| Fichero | Tamaño | Formato | |
|---|---|---|---|
| 175.-CC.pdf | 129.64 kB | Adobe PDF | Visualizar/Abrir |