<s>
The	O
Schmidt-Samoa	B-Algorithm
cryptosystem	I-Algorithm
is	O
an	O
asymmetric	O
cryptographic	O
technique	O
,	O
whose	O
security	O
,	O
like	O
Rabin	B-Algorithm
depends	O
on	O
the	O
difficulty	O
of	O
integer	O
factorization	O
.	O
</s>
<s>
Unlike	O
Rabin	B-Algorithm
this	O
algorithm	O
does	O
not	O
produce	O
an	O
ambiguity	O
in	O
the	O
decryption	O
at	O
a	O
cost	O
of	O
encryption	O
speed	O
.	O
</s>
<s>
To	O
decrypt	O
a	O
ciphertext	O
c	O
we	O
compute	O
the	O
plaintext	O
as	O
which	O
like	O
for	O
Rabin	B-Algorithm
and	O
RSA	B-Architecture
can	O
be	O
computed	O
with	O
the	O
Chinese	O
remainder	O
theorem	O
.	O
</s>
<s>
The	O
algorithm	O
,	O
like	O
Rabin	B-Algorithm
,	O
is	O
based	O
on	O
the	O
difficulty	O
of	O
factoring	O
the	O
modulus	O
N	O
,	O
which	O
is	O
a	O
distinct	O
advantage	O
over	O
RSA	B-Architecture
.	O
</s>
<s>
The	O
algorithm	O
processes	O
decryption	O
as	O
fast	O
as	O
Rabin	B-Algorithm
and	O
RSA	B-Architecture
,	O
however	O
it	O
has	O
much	O
slower	O
encryption	O
since	O
the	O
sender	O
must	O
compute	O
a	O
full	O
exponentiation	O
.	O
</s>
