Privacy is the most important apprehension in many data mining applications. In this paper a new technique called Cryptic Random Projection, solves the re-identification quandary (which is found in the conventional random projections).Here this encryption based random projection assigns secret keys to the positions of random matrix elements and not to the random numbers. We have addressed two kinds of random sequences for generating the random sequences called determinist and indeterminist random sequences and encrypted it in a new way so that the original data cannot be re-identified. We have also optimized the privacy level which toughens the re-identification of original data without compromising the processing speed and data utility. We hope the projected solution will tarmac way for investigation track and toil well according to the evaluation metrics including hiding effects, data utility, and time performance. ©2009 IEEE.