Home Another look at automated theorem-proving II
Article Open Access

Another look at automated theorem-proving II

  • Neal Koblitz EMAIL logo
Published/Copyright: January 25, 2012
Download Article (PDF)
Become an author with De Gruyter Brill
Submit Manuscript Author Information
Journal of Mathematical Cryptology
From the journal Journal of Mathematical Cryptology Volume 5 Issue 3-4

Received: 2011-10-30
Revised: 2011-12-01
Accepted: 2011-12-05
Published Online: 2012-01-25
Published in Print: 2012-February

© 2012 by Walter de Gruyter Berlin Boston

Articles in the same Issue

  1. Prelims
  2. Another look at automated theorem-proving II
  3. Families of elliptic curves with rational 3-torsion
  4. A family of weak keys in HFE and the corresponding practical key-recovery
  5. On the Bringer–Chabanne EPIR protocol for polynomial evaluation
https://doi.org/10.1515/jmc-2011-0014
Keywords for this article
Automated theorem-proving; computer-assisted proof; proof checking; public key cryptography; encryption
Creative Commons
BY-NC-ND 3.0

Articles in the same Issue

  1. Prelims
  2. Another look at automated theorem-proving II
  3. Families of elliptic curves with rational 3-torsion
  4. A family of weak keys in HFE and the corresponding practical key-recovery
  5. On the Bringer–Chabanne EPIR protocol for polynomial evaluation
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 6.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jmc-2011-0014/html
Scroll to top button