Publications

 

 

 

  1. A. Rotaru, S. Iftene. A Complete Generalization of Atkin's Square Root Algorithm. Fundamenta Informaticae,  Volume 125, Number 1, Pages 71-94 (2013), DOI: 10.3233/FI-2013-853 ;

 

  1. S. Iftene. Some Connections Between Primitive Roots and Quadratic Non-Residues Modulo a Prime. Cryptology ePrint Archive, Report 2012/470, 2012 . (available at http://eprint.iacr.org/);

 

  1. A. Dudeanu, G. R. Oancea, S. Iftene. An x -Coordinate Point Compression Method for Elliptic Curves over Fp. In T. Jebelean, V. Negru, D. Petcu, and D. Zaharie, editors, Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 2010, pages 65-71, IEEE Computer Society Press;

 

  1. D. Pasaila, V. Alexa, S. Iftene. Cheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes.  International  Scientific  Journal  of  Computing  Vol. 9,  Issue 2, 2010, pages 107-117 (a preliminary version of this paper appeared as Cryptology ePrint Archive, Report 2009/426, 2009);

 

  1. S. Iftene, D. Pasaila. A CRT-based Solution to Yao's Millionaires' Problem. In T. Jebelean, V. Negru, D. Petcu, and D. Zaharie, editors, Proceedings of the 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 2008, pages 189–192, IEEE Computer Society Press;

 

  1. S. Iftene, S. Ciobaca, M. Grindei. Compartmented Threshold RSA Based on the Chinese Remainder Theorem. Cryptology ePrint Archive, Report 2008/370, 2008. (available at http://eprint.iacr.org/);

 

  1. S. Iftene, M. Grindei. Weighted Threshold RSA Based on the Chinese Remainder Theorem. In T. Jebelean, V. Negru, D. Petcu, and D. Zaharie, editors, Proceedings of the 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 2007, pages 175-181, IEEE Computer Society Press;

 

  1. S. Iftene, F. Chelaru.  The  General  Chinese  Remainder  Theorem.  International  Scientific  Journal  of  Computing  Vol. 6,  Issue 1, 2007,  pages 44-50;

 

  1. S. Iftene. Secret Sharing Schemes with Applications in Security Protocols. Scientific Annals of Computer Science, “Al. I. Cuza” University of Iasi,  volume XVI:63–96, 2006 ( this is an extended abstract of the PhD Thesis available as Technical Report TR 07-01,  “Al.I.Cuza” University of Iasi, Faculty of Computer Science, 2007.(http://www.infoiasi.ro/˜tr/tr.pl.cgi));

 

  1. S. Iftene. General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting. Proceedings of the First Workshop in Information and Computer Security (ICS 2006), Timisoara, Romania, September 30, 2006, Electronic Notes in Theoretical Computer Science, Vol. 186, Pages 67-84 (2007), DOI:  10.1016/j.entcs.2007.01.065

(preliminary versions of some parts of this paper appeared in (11), (13));

 

  1. S. Iftene. General secret sharing based on the Chinese remainder theorem. Cryptology ePrint Archive, Report 2006/166, 2006. (available at http://eprint.iacr.org/) (a newer version of this paper, not a superset, appeared in (10));

 

  1. S. Iftene. General information dispersal based on the Chinese remainder theorem. In I. Dziţac, F.-G. Filip, and M.-J. Manolescu, editors, ICCCC 2006, International Conference On Computers, Communications&Control, Oradea, Romania, June 2006, pages 274–279, 2006. (Supplementary issue of International Journal of Computers, Communications&Control);

 

  1. S. Iftene. Compartmented secret sharing based on the Chinese remainder theorem. Cryptology ePrint Archive, Report 2005/408, 2005. (available at http://eprint.iacr.org/) (a newer version of this paper appeared in (10));

 

  1. S. Iftene and I. Boureanu. Weighted threshold secret sharing based on the Chinese remainder theorem. Scientific Annals of the “Al. I. Cuza” University of Iasi, Computer Science Section, volume XV:161–172, 2005;

 

  1. S. Iftene. General secret sharing based on determinants. In T. Jebelean, V. Negru, D. Petcu, and D. Zaharie, editors, Proceedings of the 7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 2005, pages 154–157. IEEE Computer Society Press, 2005;

 

  1. S. Iftene. Threshold RSA based on the general Chinese remainder theorem.       Technical Report             TR 05-05,  “Al.I.Cuza” University of Iasi, Faculty of Computer Science, 2005.

(available at http://www.infoiasi.ro/˜tr/tr.pl.cgi);

 

  1. S. Iftene. A generalization of Mignotte’s secret sharing scheme. In T. Jebelean, V. Negru, D. Petcu, and D. Zaharie, editors, Proceedings of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 2004, pages 196–201. Mirton Publishing House, 2004;

 

  1. Sorin Iftene. Modular exponentiation. International Scientific Journal of Computing Vol. 2, Issue 3, 2003, pages 49-55 (a  preliminary version of this paper was presented at CIPC 2003, Sinaia, Romania);

 

  1. F. L. Ţiplea, S. Iftene, C. Hriţcu, I. Goriac, R. Gordân, E. Erbiceanu. MpNT: A Multi-Precision Number Theory Package. Number Theoretical Algorithms (I), Technical Report TR03-02, Faculty of Computer  Science, “Al. I. Cuza” University, Iaşi, 2003

(available at http://www.infoiasi.ro/˜tr/tr.pl.cgi);

 

  1. F.L. Ţiplea, S. Iftene, B. Ciurariu, C. Apachiţe Subset Based Properties of Partially Ordered Sets,   Technical   Report TR02-01, Faculty of Computer Science, “Al. I. Cuza” University, Iaşi, 2002

(available at http://www.infoiasi.ro/˜tr/tr.pl.cgi).