Here is one example of the difference between Kronecker and Dedekind. Suppose ${\mathfrak a}$ is an ideal in the ring of integers of a number field $K$ and I ask you to compute the norm of this idealits norm, i.e., the size of ${\cal O}_K/\mathfrak a$. How would you do it? From Dedekind's point of view, you find a ${\mathbf Z}$-basis of ${\cal O}_K$ and of ${\mathfrak a}$, write the basis of the ideal in terms of the basis of the ring of integers, and then compute (the absolute value of) the determinant of the matrix expressing the ideal basis in terms of the ring basis. But as you may know, ideals usually are not given to us in terms of a ${\mathbf Z}$-basis. More often they are given in terms of just two generators, say ${\mathfrak a} = (\alpha,\beta)$. How can you compute the norm of the ideal in terms of the two generators? In principle it should be possible, since the two generators determine the ideal they generate, so all the data you need is encoded in the numbers $\alpha$ and $\beta$.
There is a Dedekind-style way to write the norm of ${\mathfrak a}$ in terms of the two generators: the norm of an ideal is the gcd of the norms of all elements of the ideal.
Watch out: you can't get by using only the gcd of the norms of the two generators.
For example, in the Gaussian integers the ideal $(1+2i,1-2i)$ is the unit ideal $(1)$, so it has norm 1, but the two generators $1+2i$ and $1-2i$ have norm 5, whose gcd is not 1. (Of course the ideal also contains $1+2i - (1-2i) = 4i$, whose norm is 4, and the gcd of that with 5 is one and you're done.) In principle you only need to form the gcd of the norms of a finite number of elements in the ideal, but it's not clear how to do that in an easy way compared with the above determinant methodwhich "finitely many" elements are practically enough. So I think it's fair to say Dedekind's point of view does not easily allow you to find the norm of an ideal in terms of two generators of the ideal, which is how one usually thinks about them concretely.