A secure division system comprising three secure computation apparatuses, taking an input of a distributed value [a] of a dividend "a" and a divisor "d," and calculating a distributed value [a/d] of a division result a/d in which the dividend "a" is divided by the divisor "d" and a fractional part is truncated, wherein "p" is a prime number, [·] is a distributed value obtained by distributing a value "." by first secret sharing with three shares, <·> is a distributed value obtained by distributing the value "-" by additive secret sharing with two shares, the distributed value [·] and the distributed value <·> can be mutually converted, "a" is a dividend, "d" is a divisor, and / is an operator that represents division in which a fractional part is truncated, and wherein the secure computation apparatuses each include: an input conversion part that converts the distributed value [a] into a distributed value <a>=<a> 0, <a> 1 of the additive secret sharing; a public value multiplication part that calculates a distributed value <a'>=<2a> and a value d'=2d by using the distributed value [a] and the divisor "d"; a quotient transfer part that obtains a distributed value <q> of a quotient "q" where a value a' is divided by the prime number p, by using the distributed value <a'>; a public division part that obtains a quotient p' and a residual r' where the prime number p is divided by the value d'; an approximation part that calculates <b> 0 =(<a'> 0 +d'-1-r')/d' and <b> 1 =<a'> 1 /d', to generate a distributed value <b>=<b> 0, <b> 1 by using the distributed value <a'>, the value d', and the residual r'; an output computation part that calculates <b>-(p'+1)<q>+1 to obtain as a distributed value <a/d> of the division result a/d by using the distributed values <b> and <q> and the quotient p'; and an output conversion part that converts the distributed value <a/d> into the distributed value [a/d] of the first secret sharing. wherein "p" is a prime number, [·] is a distributed value obtained by distributing a value "." by first secret sharing with three shares, <·> is a distributed value obtained by distributing the value "-" by additive secret sharing with two shares, the distributed value [·] and the distributed value <·> can be mutually converted, "a" is a dividend, "d" is a divisor, and / is an operator that represents division in which a fractional part is truncated, and wherein the secure computation apparatuses each include: an input conversion part that converts the distributed value [a] into a distributed value <a>=<a> 0, <a> 1 of the additive secret sharing; a public value multiplication part that calculates a distributed value <a'>=<2a> and a value d'=2d by using the distributed value [a] and the divisor "d"; a quotient transfer part that obtains a distributed value <q> of a quotient "q" where a value a' is divided by the prime number p, by using the distributed value <a'>; a public division part that obtains a quotient p' and a residual r' where the prime number p is divided by the value d'; an approximation part that calculates <b> 0 =(<a'> 0 +d'-1-r')/d' and <b> 1 =<a'> 1 /d', to generate a distributed value <b>=<b> 0, <b> 1 by using the distributed value <a'>, the value d', and the residual r'; an output computation part that calculates <b>-(p'+1)<q>+1 to obtain as a distributed value <a/d> of the division result a/d by using the distributed values <b> and <q> and the quotient p'; and an output conversion part that converts the distributed value <a/d> into the distributed value [a/d] of the first secret sharing. an input conversion part that converts the distributed value [a] into a distributed value <a>=<a> 0, <a> 1 of the additive secret sharing; a public value multiplication part that calculates a distributed value <a'>=<2a> and a value d'=2d by using the distributed value [a] and the divisor "d"; a quotient transfer part that obtains a distributed value <q> of a quotient "q" where a value a' is divided by the prime number p, by using the distributed value <a'>; a public division part that obtains a quotient p' and a residual r' where the prime number p is divided by the value d'; an approximation part that calculates <b> 0 =(<a'> 0 +d'-1-r')/d' and <b> 1 =<a'> 1 /d', to generate a distributed value <b>=<b> 0, <b> 1 by using the distributed value <a'>, the value d', and the residual r'; an output computation part that calculates <b>-(p'+1)<q>+1 to obtain as a distributed value <a/d> of the division result a/d by using the distributed values <b> and <q> and the quotient p'; and an output conversion part that converts the distributed value <a/d> into the distributed value [a/d] of the first secret sharing.