An efficient probabilistic public-key cryptosystem over quadratic fields quotients

DOI10.1016/j.ffa.2006.05.004zbMath1129.11056MaRDI QIDQ2370640

Guilhem Castagnos

Publication date: 29 June 2007

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2006.05.004

zbMATH Keywords

quadratic fields; public-key cryptosystems; Lucas sequences

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11R11: Quadratic extensions

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

11B39: Fibonacci and Lucas numbers and polynomials and generalizations

Related Items

A new cryptosystem using generalized Mersenne primes, Secure public-key encryption scheme without random oracles, A generalized attack on RSA type cryptosystems, A generalized attack on some variants of the RSA cryptosystem, A New Attack on Three Variants of the RSA Cryptosystem, An Improved Analysis on Three Variants of the RSA Cryptosystem, Two Generic Constructions of Probabilistic Cryptosystems and Their Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the security of the Lucas function
• Elliptic curve Paillier schemes
• Finding a Small Root of a Univariate Modular Equation
• Lucas Pseudoprimes
• A p + 1 Method of Factoring
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm