[图书][B] Residue Number Systems
PVA Mohan, PVA Mohan - 2016 - Springer
The design of algorithms and hardware implementation for signal processing systems has
received considerable attention over the last few decades. The primary area of application …
received considerable attention over the last few decades. The primary area of application …
Implementing cryptographic pairings over Barreto-Naehrig curves
In this paper we describe an efficient implementation of the Tate and Ate pairings using
Barreto-Naehrig pairing-friendly curves, on both a standard PC and on a 32-bit smartcard …
Barreto-Naehrig pairing-friendly curves, on both a standard PC and on a 32-bit smartcard …
Comparing the pairing efficiency over composite-order and prime-order elliptic curves
A Guillevic - Applied Cryptography and Network Security: 11th …, 2013 - Springer
We provide software implementation timings for pairings over composite-order and prime-
order elliptic curves. Composite orders must be large enough to be infeasible to factor. In the …
order elliptic curves. Composite orders must be large enough to be infeasible to factor. In the …
Faster squaring in the cyclotomic subgroup of sixth degree extensions
This paper describes an extremely efficient squaring operation in the so-called 'cyclotomic
subgroup'of F_q^6^*, for q≡16. Our result arises from considering the Weil restriction of …
subgroup'of F_q^6^*, for q≡16. Our result arises from considering the Weil restriction of …
Efficient pairings and ECC for embedded systems
T Unterluggauer, E Wenger - … and Embedded Systems–CHES 2014: 16th …, 2014 - Springer
The research on pairing-based cryptography brought forth a wide range of protocols
interesting for future embedded applications. One significant obstacle for the widespread …
interesting for future embedded applications. One significant obstacle for the widespread …
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation
A Guillevic, S Masson, E Thomé - Designs, Codes and Cryptography, 2020 - Springer
Recent algorithmic improvements of discrete logarithm computation in special extension
fields threaten the security of pairing-friendly curves used in practice. A possible answer to …
fields threaten the security of pairing-friendly curves used in practice. A possible answer to …
Novel area-efficient and flexible architectures for optimal Ate pairing on FPGA
While FPGA is a suitable platform for implementing cryptographic algorithms, there are
several challenges associated with implementing Optimal Ate pairing on FPGA, such as …
several challenges associated with implementing Optimal Ate pairing on FPGA, such as …
Software implementation of pairings
Software Implementation of Pairings Page 1 Chapter XII Software Implementation of Pairings
Darrel HANKERSONa, Alfred MENEZESb and Michael SCOTT c a Auburn University, USA b …
Darrel HANKERSONa, Alfred MENEZESb and Michael SCOTT c a Auburn University, USA b …
[PDF][PDF] Scalable practical byzantine fault tolerance with short-lived signature schemes
X Fan - Proceedings of the 28th Annual International …, 2018 - files.iotex.io
ABSTRACT The Practical Byzantine Fault Tolerance (PBFT) algorithm is a popular solution
for establishing consensus in blockchain systems. The execution time of the PBFT …
for establishing consensus in blockchain systems. The execution time of the PBFT …
[PDF][PDF] Succinct Non-Interactive Arguments for a von Neumann Architecture.
Succinct Non-Interactive Arguments for a von Neumann Architecture Page 1 Succinct Non-Interactive
Arguments for a von Neumann Architecture Eli Ben-Sasson Technion Alessandro Chiesa …
Arguments for a von Neumann Architecture Eli Ben-Sasson Technion Alessandro Chiesa …