The following pages link to Paulo S. L. M. Barreto (Q473199):
Displaying 30 items.
- Quantum-assisted QD-CFS signatures (Q473200) (← links)
- A survey on key management mechanisms for distributed wireless sensor networks (Q605648) (← links)
- Rotation symmetry in algebraically generated cryptographic substitution tables (Q963378) (← links)
- Faster isogeny-based compressed key agreement (Q1644770) (← links)
- CAKE: CODE-based algorithm for key encapsulation (Q1744856) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Isogeny-based key compression without pairings (Q2061915) (← links)
- Designing efficient dyadic operations for cryptographic applications (Q2191206) (← links)
- The lattice-based digital signature scheme qTESLA (Q2229291) (← links)
- Security issues in Sarkar's e-cash protocol (Q2353647) (← links)
- Efficient computation of roots in finite fields (Q2491305) (← links)
- Whirlwind: a new cryptographic hash function (Q2638401) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- The Realm of the Pairings (Q2949520) (← links)
- Lyra2: Efficient Password Hashing with High Security against Time-Memory Trade-Offs (Q2985261) (← links)
- Revisiting the Security of the ALRED Design and Two of Its Variants: Marvin and LetterSoup (Q2989813) (← links)
- Signcryption Schemes Based on the Diffie–Hellman Problem (Q3000030) (← links)
- Signcryption Schemes Based on Bilinear Maps (Q3000031) (← links)
- Quasi-Dyadic CFS Signatures (Q3019935) (← links)
- Monoidic Codes in Cryptography (Q3102791) (← links)
- Schnorr-Based Implicit Certification: Improving the Security and Efficiency of Vehicular Communications (Q3389773) (← links)
- On Compressible Pairings and Their Computation (Q3506394) (← links)
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three (Q3522142) (← links)
- Compact McEliece Keys from Goppa Codes (Q3651272) (← links)
- Faster Key Compression for Isogeny-Based Cryptosystems (Q5228936) (← links)
- A Panorama of Post-quantum Cryptography (Q5255859) (← links)
- Decoding Square-Free Goppa Codes Over $\BBF_{p}$ (Q5346328) (← links)
- Pairing-Friendly Elliptic Curves of Prime Order (Q5426200) (← links)
- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (Q5451088) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710836) (← links)
