Search from the Journals, Articles, and Headings
Advanced Search (Beta)
Loading...
Loading...
Loading...
Loading...
Loading...
Loading...

Preface

Before the creation of Pākistān, there were multiple points functional as circles of Qur’ānic Durūs. Among these, Dars-e- Qur’ān by Sheikh al Tafsīr Maulānā Aḥmad ‘Alī Lāhorī (d:1381A.H/1962A.D) was of a distinguished standing. Scholars from remote areas of Delhī, Luckhnow, and even of Deobund used to come over here for the genesis of the Qur’ān. Among these personalities is Maulānā Akhlāq Ḥusain Qāsmī of Delhī as well as the famous and great literary figure of the Islamic World Maulānā Abu’l-Ḥasan ‘Alī Nadvī (d:1420A.H/1999A.D). Maulānā ‘Alī Mian made a mention of it in the session of ‘Ālmī Rābitah al Adab al   Islāmī in 1999 A.D at Lāhore. He said,“I confess with pride that I have gained a lot from Maulānā Aḥmad ‘Alī Lāhorī”. Moreover, these were not only the orthodox scholars who benefited from Ḥaḍrat Lāhorī but a large number of modern scholars were also on his panel as well-wishers. The name of the famous literary and scholarly figure Dr. Syed ‘Abdallāh (d:1406-A.H/1986A.D) may be quoted as an example. Prior to and after the creation of Pākistān, out of many distinguished Qur’ānic Circles, a few of these are particularly worth mentioning:

Maulānā Abu’l-Ḥasanāt Qādrī (Masjid-e-Wazīr Khān)

Maulānā Dāwūd Ghaznavī (Chuniān Wālī Masjid)

Maulānā Ghulām Murshid (Bādshāhī Masjid)

Maulānā ‘Abdallāh Farūqī  (Delhi Muslim Hotel, Old Anār Kalī)

Maulānā Maudūdī (‘Abd al-Karīm Road, Qil‘ah Gojar Singh).

Dr.  Isrār Aḥmad was also one of the links in the chain; he established Circles of Durūs-e- Qur’ān not only in Lāhore but in the entire country and invested all his potential to make the message of the Qur’ān so public. This book highlights his services and thoughts. There are five chapters in the book. The first chapter is entitled “Dr. Isrār...

Islamic Charity and Social Development in Pakistan

“Whoever extinguishes the fire of the greed of “Nafs (self)” gets prosperous” is the leitmotif of Quran. Islam in its best is the religion of the oppressed, even itsworships rather than mere rituals are conduit of socioeconomic and political justice a panacea to social development. Prayers of community stay hypocritical ifpoverty, destitution and oppression prevail in community. Quran crushes the spirit of acquisitiveness and strikes moral order based on socio-economic andpolitical justice. For social equilibrium charity, Zakat and Sadaqat are recurrent theme of Quran. To the Dreamer and the Architect, Pakistan was poised tobecome an Islamic welfare state. So, this paper intends to portray what is needed to eliminate social inequalities in the social fabric of the state. What the people and the state ought to do in the light of Islamic ideals? To Shah Wali Allah, Zakat is a sure enough recipe to run a state and strike social equilibrium if employed to the spirit of Quran.

Efficient Hardware Design of Elliptic Curve Point Multiplication Accelerators

In recent years, the evolution of technology has broadened the avenues of information sharing. The volume of sensitive and important information being exchanged over the insecuremediumhasincreaseddramatically. Ellipticcurvecryptography(ECC)hasbecomewidelyacceptedasanefficientmechanismtosecureprivatedatausingpublic-key protocols. The pivotal operation within ECC based crypto-systems is scalar point multiplication which is computationally expensive. Point multiplication can be achieved by iterative execution of point addition and point doubling groups operations which in turn are based on finite field arithmetic operations such as addition, subtraction, multiplication and division. These finite field arithmetic operations, especially the finite field multiplication are the bottleneck of any ECC based crypto-system. To reduce the computational cost of point multiplication operation, by optimizing these finite field arithmetic operations, is an active area of research. Efficient hardware implementations of Elliptic Curve Point Multipliers (ECPM) over several new platforms have been in the focal point of major research efforts for the last two decades. Field Programmable gate arrays (FPGA) due to its reconfigurable nature and less development time has become a very popular choice for hardware implementationofcryptographicalgorithms. ECPMarchitecturesonFPGAeitheronlyuseLook Up Tables (LUTs) or have utilized embedded Digital signal processing (DSP) blocks along with the LUTs. LUTs-only based designs are portable designs since they can be translated to any FPGA family or standard cell based Application Specific Integrated Circuits(ASIC).However,existingLUTsbaseddesignsareslowersincetheyarebased on finite field arithmetic components which have longer critical path delay and higher clock cycles consumption. DSP based ECPM designs may offer better performance at the cost of increased area. However, DSP based designs have portability issues. The prime objective of this dissertation is to design LUTs based high speed ECPM architectures. ThebottomlayerFp arithmeticoperationsespeciallytheFp multiplication are first optimized at both circuit level and architectural level. Subsequently, based on these optimized finite field arithmetic primitives, and by devising an efficient schedul ing strategy for elliptic curve group operations, this dissertation achieves high speed hardware architectures to perform elliptic curve point multiplication. Inthefirstcontribution,anovelhighspeedRedundant-Signed-Digit(RSD)basedECPM architecture for arbitrary curves over a general prime field is designed. It is based on a new high speed finite field multiplier architecture which employs different parallel computation techniques at both circuit level and architectural level. As a result of these optimizationstrategies,theproposedmultiplieroffersasignificantreductionincomputation time over the state-of-the-art. An efficient scheduling strategy is devised for PA andPDgroupoperationswhichreducedtherequirednumberofclockcyclesforECPM design. The ECPM architecture designed in this dissertation offers higher speed and lower area-time product than recent state-of-the-art ECPM designs. In the second contribution of this dissertation, an ECPM architecture for low area applications is developed. The ECPM design utilizes fewer resources while maintaining the competitive speed with other state-of-the-art ECPMs. The finite field multiplier developed in this dissertation offers lower area-time product than recent contemporary designs. Basedonthisfinitefieldmultiplierandapipelinedfinitefieldadder/subtractor, an ECPM architecture is designed that offers lower area-time product than recent stateof-the-art ECPM designs. The third contribution presents a high speed ECPM architecture for National Institute of Standards and Technology (NIST) recommended primes. Different strategies such as RSD representation, segmentation and pipelining are used to reduce the critical path delayandrequirednumberofclockcyclesforthefinitefieldarithmeticprimitives. The implementation results demonstrate that the proposed ECPM architecture outperforms other state-of-the-art designs in terms of speed and area-time product metrics. Finally, an ECPM architecture for the Curve448 is developed in the last contribution of this dissertation. Curve448 is recently recommended by the Internet Engineering Task Force (IETF) for future cryptography. The only existing ECPM architecture over the Curve448isaDSPbaseddesignandlacksportability. TheECPMarchitecturedesigned inthisdissertationisthefirstLUTsbasedimplementationfortheCurve448. Thedesign is optimized with a focus on both performance and resource utilization. A comparison with the state-of-the-art ECPM designs shows that ECPM design in this dissertation provides higher speed and can be adopted in time-critical applications.
Asian Research Index Whatsapp Chanel
Asian Research Index Whatsapp Chanel

Join our Whatsapp Channel to get regular updates.