An efficient probabilistic public-key cryptosystem over

by Guilhem Castagnos

Citations:

1 - 0 self

@MISC{Castagnos_anefficient,
    author = {Guilhem Castagnos},
    title = {An efficient probabilistic public-key cryptosystem over},
    year = {}
}

quadratic fields quotients

441	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT - Paillier - 1999
78	The XTR public key system - Lenstra, Verheul - 2000
76	Finding a small root of a univariate modular equation - Coppersmith - 1996
36	A p+1 method of factoring - Williams - 1982
35	A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms - Smith, Skinner - 1994
27	Paillier’s cryptosystem revisited - Catalano, Gennaro, et al. - 2001
26	A new public key system - Smith, Lennon, et al. - 1993
15	Elliptic Curve Paillier Schemes - Galbraith - 2002
14	Some remarks on lucas-based cryptosystems - Bleichenbacher, Bosma, et al. - 1995
7	The hardness of Hensel lifting: The case of RSA and discrete logarithm - Catalano, Nguyen, et al. - 2002
5	Ecient Computation of Full Lucas Sequences - Joye, Quisquater - 1996
4	An efficient semantically secure elliptic curve cryptosystem based on KMOV - Galindo, Martín, et al. - 2003
1	pseudo primes - Baillie, Jr, et al. - 1980
1	Federal Information Processing Standards Publications. Security requirements for cryptographic modules; May 25, 2001 - PUB - 2000
1	Fu-Kuan Tu and Wen-Chung Tai, On the security of the Lucas function - Laih - 1995