All Stories

  1. Post-Quantum Cryptography for Quantum Resilient Data Transfer
  2. LEARNING OBJECTS IN UNIVERSITY TEACHING OF BASIC NATURAL SCIENCE SUBJECTS
  3. ARM Architecture Optimizations for Line-Rate PQC Communications
  4. First Demonstration of 200 Gbps Regime Line-Rate Quantum-Secure MACsec Optical Links Using Commodity Hardware Offloads
  5. Low-Complexity Hardware Architecture of APN Permutations Using TU-Decomposition
  6. Integrating Post-Quantum Cryptography Plugins for IPsec Offloads to Data Processing Units in the Cloud-Edge Continuum
  7. In-line rate encrypted links using pre-shared post-quantum keys and DPUs
  8. Wireless and Fiber-Based Post-Quantum-Cryptography-Secured IPsec Tunnel
  9. Efficient Low-Latency Multiplication Architecture for NIST Trinomials With RISC-V Integration
  10. The zero-tax data center: a use case through quantum resilient communications
  11. Falcon/Kyber and Dilithium/Kyber Network Stack on Nvidia’s Data Processing Unit Platform
  12. First Line-rate End-to-End Post-Quantum Encrypted Optical Fiber Link Using Data Processing Units (DPUs)
  13. Hardware architecture of Dillon’s APN permutation for different primitive polynomials
  14. Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks
  15. INTERACTIVE RESOURCES TO ENHANCE SELF-LEARNING IN HIGHER EDUCATION
  16. Decomposition of Dillon’s APN Permutation with Efficient Hardware Implementation
  17. Work-in-Progress: High-Performance Systolic Hardware Accelerator for RBLWE-based Post-Quantum Cryptography
  18. Efficient Hardware Arithmetic for Inverted Binary Ring-LWE Based Post-Quantum Cryptography
  19. Low-Delay FPGA-Based Implementation of Finite Field Multipliers
  20. Efficient Hardware Implementation of Finite Field Arithmetic AB+C for Binary Ring-LWE Based Post-Quantum Cryptography
  21. Optimized reversible quantum circuits for $${\mathbb {F}}_{2^8}$$ multiplication
  22. High-throughput architecture for post-quantum DME cryptosystem
  23. FPGA Implementation of Post-Quantum DME Cryptosystem
  24. LFSR-based Bit-Serial $GF(2^m)$ Multipliers using Irreducible Trinomials
  25. Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials
  26. Efficient FPGA Implementation of Binary Field Multipliers Based on Irreducible Trinomials
  27. Reconfigurable implementation of GF(2m) bit-parallel multipliers
  28. Low-delay AES polynomial basis multiplier
  29. High-Speed Polynomial Basis Multipliers Over GF(2m) for Special Pentanomials
  30. Low complexity bit-parallel polynomial basis multipliers over binary fields for special irreducible pentanomials
  31. Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations
  32. Efficient Polynomial Basis Multipliers for Type-II Irreducible Pentanomials
  33. Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation
  34. Low Latency $GF(2^{m})$ Polynomial Basis Multiplier
  35. Efficient FPGA Modular Multiplication and Exponentiation Architectures Using Digit Serial Computation
  36. Probabilistic Verification over GF(2m) Using Mod2-OBDDs
  37. Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials
  38. Finite Fields: Applications and Implementations – Guest Editorial
  39. Bit-parallel finite field multipliers for irreducible trinomials
  40. Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields GF(2 m ) Generated by AOPs
  41. Streaming potential across cation-exchange membranes in methanol–water electrolyte solutions
  42. A New Reconfigurable-Oriented Method for Canonical Basis Multiplication over a Class of Finite Fields GF(2m)
  43. Effect of an AC perturbation on a desalination electrodialysis process
  44. Formulation for the computation of Boolean operations