
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Alessandro Cilardo, "Exploring the Potential of Threshold Logic for CryptographyRelated Operations," IEEE Transactions on Computers, vol. 60, no. 4, pp. 452462, April, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.116, author = {Alessandro Cilardo}, title = {Exploring the Potential of Threshold Logic for CryptographyRelated Operations}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {4}, issn = {00189340}, year = {2011}, pages = {452462}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.116}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Exploring the Potential of Threshold Logic for CryptographyRelated Operations IS  4 SN  00189340 SP452 EP462 EPD  452462 A1  Alessandro Cilardo, PY  2011 KW  Threshold logic KW  modular arithmetic KW  Montgomery multiplication. VL  60 JA  IEEE Transactions on Computers ER   
[1] V. Beiu, J.M. Quintana, and M.J. Avedillo, "VLSI Implementations of Threshold Logic—a Comprehensive Survey," IEEE Trans. Neural Networks, vol. 14, no. 5, pp. 12171243, Sept. 2003.
[2] I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic Curves in Cryptography. Cambridge Univ. Press, 1999.
[3] T. Blum and C. Paar, "HighRadix Montgomery Modular Exponentiation on Reconfigurable Hardware," IEEE Trans. Computers, vol. 50, no. 7, pp. 759764, July 2001.
[4] J. Bruck, "Harmonic Analysis of Polynomial Threshold Functions," SIAM J. Discrete Math., vol. 3, no. 2, pp. 168177, May 1990.
[5] S. Cotofana, C. Lageweg, and S. Vassiliadis, "Addition Related Arithmetic Operations via Controlled Transport of Charge," IEEE Trans. Computers, vol. 54, no. 3, pp. 243256, Mar. 2005.
[6] M. Goldmann, J. Håstad, and A. Razborov, "Majority Gates vs. General Weighted Threshold Gates," Proc. Seventh Ann. Conf. Structure in Complexity Theory, pp. 213, 1992.
[7] M. Goldmann and M. Karpinski, "Simulating Threshold Circuits by Majority Circuits," Proc. 25th Ann. ACM Symp. Theory of Computing, pp. 551560, May 1993.
[8] J. Håstad, "Almost Optimal Lower Bounds for Small Depth Circuits," Proc. 18th Ann. ACM Symp. Theory of Computing, vol. 18, pp. 620, 1986.
[9] Int'l Technology Roadmap for Semiconductors, 2005 ed., http:/www.itrs.net, 2010.
[10] C. Lageweg, S. Cotofana, and S. Vassiliadis, "A Linear Threshold Gate Implementation in SingleElectron Technology," Proc. IEEE CS Workshop Very Large Scale Integration (VLSI), pp. 9398, Apr. 2001.
[11] P. Mazumder, S. Kulkarni, M. Bhattacharya, J.P. Sun, and G.I. Haddad, "Digital Circuit Applications of Resonant Tunneling Devices," Proc. IEEE, vol. 86, no. 4, pp. 664686, Apr. 1998.
[12] C. Meenderinck and S. Cotofana, "Computing Division Using SingleElectron Tunneling Technology," IEEE Trans. Nanotechnology, vol. 6, no. 4, pp. 451459, July 2007.
[13] P.L. Montgomery, "Modular Multiplication without Trial Division," Math. Computation, vol. 44, no. 170, pp. 519521, Apr. 1985.
[14] S. Muroga, Threshold Logic and Its Applications. Wiley, 1971.
[15] S.B. Örs, L. Batina, B. Preneel, and J. Vandewalle, "Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '03), p. 184b, 2003.
[16] W. Porod, C. Lent, G.H. Bernstein, A.O. Orlov, I. Hamlani, G.L. Snider, and J.L. Merz, "QuantumDot Cellular Automata: Computing with Coupled Quantum Dots," Int'l J. Electronics, vol. 86, no. 5, pp. 549590, 1999.
[17] R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and PublicKey Cryptosystems," Comm. ACM, vol. 21, pp. 120126, 1978.
[18] M.O. Sanu, E.E. Swartzlander, and C.M. Chase, "Parallel Montgomery Multipliers," Proc. 15th IEEE Int'l Conf. ApplicationSpecific Systems, Architectures and Processors (ASAP '04), pp. 6372, 2004.
[19] K.Y. Siu and J. Bruck, "Neural Computation of Arithmetic Functions," Proc. IEEE, vol. 78, no. 10, pp. 16691675, Oct. 1990.
[20] K.Y. Siu and J. Bruck, "On the Power of Threshold Circuits with Small Weights," SIAM J. Discrete Math., vol. 4, no. 3, pp. 423435, Aug. 1991.
[21] K.Y. Siu, J. Bruck, T. Kailath, and T. Hofmeister, "Depth Efficient Neural Networks for Division and Related Problems," IEEE Trans. Information Theory, vol. 39, no. 3, pp. 946956, May 1993.
[22] K.Y. Siu and V.P. Roychowdhury, "On Optimal Depth Threshold Circuits for Multiplication and Related Problems," SIAM J. Discrete Math., vol. 7, no. 2, pp. 284292, May 1994.
[23] W.C. Tsai, C.B. Shung, and S.J. Wang, "Two Systolic Architectures for Modular Multiplication," IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 8, no. 1, pp. 103107, Feb. 2000.
[24] S. Vassiliadis, S. Cotofana, and K. Bertels, "21 Addition and Related Arithmetic Operations with Threshold Logic," IEEE Trans. Computers, vol. 45, no. 9, pp. 10621067, Sept. 1996.
[25] C.D. Walter, "Systolic Modular Multiplication," IEEE Trans. Computers, vol. 42, no. 3, pp. 376378, Mar. 1993.
[26] Nanoelectronics and Information Technology: Advanced Electronic Materials and Novel Devices, R. Waser, ed., first ed. WileyVCH, 2003.
[27] T. Yang, R.A. Kiehl, and L.O. Chua, "Tunneling Phase Logic Cellular Nonlinear Networks," Int'l J. Bifurcation and Chaos, vol. 11, no. 12, pp. 28952911, 2001.