Consider a scenario where you have a digital lock that operates on a modular arithmetic system. The lock code is represented by the equation \(23x \equiv 15 \pmod{100}\). Determine the smallest positive integer \(x\) that will unlock the lock. Let's think step by step and output the final answer within \boxed{}.
user