José Luis Imaña

Orcid: 0000-0002-4220-4111

According to our database1, José Luis Imaña authored at least 28 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Falcon/Kyber and Dilithium/Kyber Network Stack on Nvidia's Data Processing Unit Platform.
IEEE Access, 2024

2023
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks.
Inf. Process. Lett., August, 2023

Hardware architecture of Dillon's APN permutation for different primitive polynomials.
Microprocess. Microsystems, 2023

2022
Efficient Hardware Implementation of Finite Field Arithmetic $AB+C$AB+C for Binary Ring-LWE Based Post-Quantum Cryptography.
IEEE Trans. Emerg. Top. Comput., 2022

Efficient Hardware Arithmetic for Inverted Binary Ring-LWE Based Post-Quantum Cryptography.
IEEE Trans. Circuits Syst. I Regul. Pap., 2022

Decomposition of Dillon's APN Permutation with Efficient Hardware Implementation.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

Work-in-Progress: High-Performance Systolic Hardware Accelerator for RBLWE-based Post-Quantum Cryptography.
Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis, 2022

2021
Low-Delay FPGA-Based Implementation of Finite Field Multipliers.
IEEE Trans. Circuits Syst. II Express Briefs, 2021

LFSR-Based Bit-Serial GF(2<sup>m</sup>) Multipliers Using Irreducible Trinomials.
IEEE Trans. Computers, 2021

Optimized reversible quantum circuits for ${\mathbb {F}}_{2^8}$ multiplication.
Quantum Inf. Process., 2021

2020
High-throughput architecture for post-quantum DME cryptosystem.
Integr., 2020

FPGA Implementation of Post-Quantum DME Cryptosystem.
Proceedings of the 28th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2020

2018
Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials.
IEEE Trans. Computers, 2018

Efficient FPGA Implementation of Binary Field Multipliers Based on Irreducible Trinomials.
Proceedings of the 26th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2018

Reconfigurable implementation of GF(2<sup>m</sup>) bit-parallel multipliers.
Proceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition, 2018

2016
High-Speed Polynomial Basis Multipliers Over GF(2<sup>m</sup>) for Special Pentanomials.
IEEE Trans. Circuits Syst. I Regul. Pap., 2016

2013
Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations.
IEEE Trans. Ind. Electron., 2013

Low complexity bit-parallel polynomial basis multipliers over binary fields for special irreducible pentanomials.
Integr., 2013

2012
Efficient Polynomial Basis Multipliers for Type-II Irreducible Pentanomials.
IEEE Trans. Circuits Syst. II Express Briefs, 2012

2011
Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation.
IEEE Trans. Ind. Electron., 2011

Low Latency GF(2<sup>m</sup>) Polynomial Basis Multiplier.
IEEE Trans. Circuits Syst. I Regul. Pap., 2011

2010
Probabilistic Verification over GF(2<sup>m</sup>) Using Mod2-OBDDs.
Intell. Inf. Manag., 2010

Efficient FPGA Modular Multiplication and Exponentiation Architectures Using Digit Serial Computation.
Proceedings of the International Conference on Field Programmable Logic and Applications, 2010

2006
Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields <i>GF</i>(2<sup><i>m</i></sup>) Generated by AOPs.
J. VLSI Signal Process., 2006

Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials.
IEEE Trans. Very Large Scale Integr. Syst., 2006

Bit-Parallel Finite Field Multipliers for Irreducible Trinomials.
IEEE Trans. Computers, 2006

2004
Reconfigurable implementation of bit-parallel multipliers over GF(2<sup>m</sup>) for two classes of finite fields.
Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology, 2004

2003
A New Reconfigurable-Oriented Method for Canonical Basis Multiplication over a Class of Finite Fields GF(2<sup>m</sup>).
Proceedings of the Field Programmable Logic and Application, 13th International Conference, 2003


  Loading...