A Performant, Misuse-Resistant API for Primality Testing
暂无分享,去创建一个
[1] Christopher Patton,et al. Partially Specified Channels: The TLS 1.3 Record Layer without Elision , 2018, IACR Cryptol. ePrint Arch..
[2] Daniel Bleichenbacher,et al. Breaking a Cryptographic Protocol with Pseudoprimes , 2005, Public Key Cryptography.
[3] Michelle L. Mazurek,et al. You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users , 2016, 2016 IEEE Cybersecurity Development (SecDev).
[4] Yehuda Lindell,et al. AES-GCM-SIV: Specification and Analysis , 2017, IACR Cryptol. ePrint Arch..
[5] Kenneth G. Paterson,et al. Data Is a Stream: Security of Stream-Based Channels , 2015, CRYPTO.
[6] Achim Jung,et al. Implementing the RSA cryptosystem , 1987, Comput. Secur..
[7] Sebastian Möller,et al. Developers Deserve Security Warnings, Too: On the Effect of Integrated Security Advice on Cryptographic API Misuse , 2018, SOUPS @ USENIX Security Symposium.
[8] Ivan Damgård,et al. On Generation of Probable Primes By Incremental Search , 1992, CRYPTO.
[9] Kenneth G. Paterson,et al. Safety in Numbers: On the Need for Robust Diffie-Hellman Parameter Validation , 2019, IACR Cryptol. ePrint Arch..
[10] Daniel J. Bernstein,et al. Curve25519: New Diffie-Hellman Speed Records , 2006, Public Key Cryptography.
[11] Matthew Smith,et al. Rethinking SSL development in an appified world , 2013, CCS.
[12] Tanja Lange,et al. The Security Impact of a New Cryptographic Library , 2012, LATINCRYPT.
[13] J. Spencer,et al. The Elementary Proof of the Prime Number Theorem , 2009 .
[14] Xi Wang,et al. Why does cryptographic software fail?: a case study and open problems , 2014, APSys.
[15] Alfredo Pironti,et al. Triple Handshakes and Cookie Cutters: Breaking and Fixing Authentication over TLS , 2014, 2014 IEEE Symposium on Security and Privacy.
[16] François Arnault. The Rabin-Monier theorem for Lucas pseudoprimes , 1997, Math. Comput..
[17] Peter Gutmann,et al. Lessons Learned in Implementing and Deploying Crypto Software , 2002, USENIX Security Symposium.
[18] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[19] Britta Hale,et al. From Stateless to Stateful: Generic Authentication and Authenticated Encryption Constructions with Application to TLS , 2015, CT-RSA.
[20] Simson L. Garfinkel,et al. Comparing the Usability of Cryptographic APIs , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[21] Paul C. van Oorschot,et al. The developer is the enemy , 2009, NSPW '08.
[22] Juraj Somorovsky,et al. Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS , 2016, WOOT.
[23] Kenneth G. Paterson,et al. Prime and Prejudice: Primality Testing Under Adversarial Conditions , 2018, IACR Cryptol. ePrint Arch..
[24] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[25] Mira Mezini,et al. "Jumping Through Hoops": Why do Java Developers Struggle with Cryptography APIs? , 2016, 2016 IEEE/ACM 38th International Conference on Software Engineering (ICSE).
[26] Phillip Rogaway,et al. Nonce-Based Symmetric Encryption , 2004, FSE.
[27] M. Rabin. Probabilistic algorithm for testing primality , 1980 .
[28] I. Damgård,et al. Average case error estimates for the strong probable prime test , 1993 .
[29] David Brumley,et al. An empirical study of cryptographic misuse in android applications , 2013, CCS.
[30] U. Maurer. Fast generation of prime numbers and secure public-key cryptographic parameters , 1995, Journal of Cryptology.
[31] Franz Mertens,et al. Ein Beitrag zur analytischen Zahlentheorie. , 1874 .
[32] C. Pomerance,et al. Prime Numbers: A Computational Perspective , 2002 .
[33] Thomas Shrimpton,et al. Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem , 2006, IACR Cryptol. ePrint Arch..
[34] Matthew Green,et al. Developers are Not the Enemy!: The Need for Usable Security APIs , 2016, IEEE Security & Privacy.
[35] Matthew Smith,et al. Why Do Developers Get Password Storage Wrong?: A Qualitative Usability Study , 2017, CCS.