Computer Science · Cryptography
पब्लिक की क्रिप्टोग्राफी में, घातांक (exponentiation) एक सामान्य रूप से उपयोग किया जाने वाला ऑपरेशन है। bn mod m (जहाँ 0 ≤ b तथा n ≤ m) की गणना करने के लिए आवश्यक गुणा की संख्या पर सबसे सटीक ऊपरी सीमा (tightest upper bound) कौन-सा विकल्प देता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n)
- 2O(n2)
- 3O(√n)
- 4O(log n)✓
सही उत्तर देखें
O(log n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Cryptography MCQs →Want more practice questions on Cryptography?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Cryptography