This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
This article's factual accuracy may be compromised due to out-of-date information. Please help update this article to reflect recent events or newly available information.(July 2023)
This article relies excessively on references to primary sources. Please improve this article by adding secondary or tertiary sources. Find sources: "Mod openpgp" – news · newspapers · books · scholar · JSTOR(July 2023) (Learn how and when to remove this message)
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Mod openpgp" – news · newspapers · books · scholar · JSTOR(July 2023) (Learn how and when to remove this message)
(Learn how and when to remove this message)
mod_openpgp
Original author(s)
Arturo 'Buanzo' Busleiman
Stable release
0.5.0
/ March 15, 2009; 15 years ago (2009-03-15)
Written in
C
Operating system
Cross-platform
Available in
C
Type
OpenPGP module for Apache HTTP server
License
Apache License
Website
wiki.buanzo.org
mod_openpgp was an Apache server module authored by Arturo 'Buanzo' Busleiman. The module implemented access authorization to servers, virtual hosts, or directories when incoming requests' HTTP OpenPGP signatures are valid and known by the local keyring. The module also allowed for the signing and encryption of HTTP requests, providing increased data integrity and confidentiality. The now defunct Enigform Mozilla Firefox extension implemented the client-side requirements of mod_openpgp.
Despite its innovative approach to HTTP request security, Mod_OpenPGP faced challenges due to the complexities of the OpenPGP standard. This resulted in the concept of signed/encrypted HTTP request enhancements sometimes falling behind other methodologies in terms of adoption and usability.
Prior to version 0.2.2, mod_openpgp was known as mod_auth_openpgp.
The author maintained his interest in OpenPGP, releasing a Python module that extends the famous requests module, with some OpenPGP capabilities.
mod_openpgp participated in the OWASP Summer of Code 2008.[1]
Enigform was mentioned in a worldwide survey of encryption products conducted by Bruce Schneier, K. Seidel, and S. Vijayakumar, highlighting its role in addressing data security challenges.[2]
Enigform received a Silver Award in the Security category at Les Trophées du Libre.
^"OWASP Summer of Code 2008". Retrieved 2009-04-15.
^B. Schneier, K. Seidel, and S. Vijayakumar (February 11, 2016). "A Worldwide Survey of Encryption Products". Schneier on Security. Retrieved 2023-07-07.{{cite web}}: CS1 maint: multiple names: authors list (link)
mod_openpgp was an Apache server module authored by Arturo 'Buanzo' Busleiman. The module implemented access authorization to servers, virtual hosts,...
request/responses by means of a client-side (Enigform) and a server-side (modopenpgp) module. There is also a WordPress plugin available, called wp-enigform-authentication...
experimental usage for digitally signed HTTP authentication in the Enigform and mod_openpgp projects; Bootstrapping secure communication protocols, such as Internet...
the standard mods and has added Oracle-specific mods such as mod_plsql. "Apache Module mod_access_compat". Apache HTTP Server 2.4 Documentation. Apache...
r = x 1 mod n {\displaystyle r=x_{1}\,{\bmod {\,}}n} . If r = 0 {\displaystyle r=0} , go back to step 3. Calculate s = k − 1 ( z + r d A ) mod n {\displaystyle...
/ q mod p {\textstyle g=h^{(p-1)/q}~{\text{mod}}~p} , it follows that g q ≡ h p − 1 ≡ 1 mod p {\textstyle g^{q}\equiv h^{p-1}\equiv 1\mod p} by Fermat's...
) m 2 mod n 2 ) = m 1 m 2 mod n , {\displaystyle D(E(m_{1},r_{1})^{m_{2}}{\bmod {n}}^{2})=m_{1}m_{2}{\bmod {n}},\,} D ( E ( m 2 , r 2 ) m 1 mod n 2 )...
ciphertext C, it is infeasible to find any pair (M, e) such that C ≡ M e mod N. The strong RSA assumption was first used for constructing signature schemes...
BassOmatic, was found to be insecure. IDEA is an optional algorithm in the OpenPGP standard. IDEA operates on 64-bit blocks using a 128-bit key and consists...
efficiently compute P given an RSA public key (N, e) and a ciphertext C ≡ P e (mod N). The structure of the RSA public key requires that N be a large semiprime...
H n ( C e r t ) {\displaystyle e=H_{n}(Cert)} CA computes s = e k + c ( mod n ) {\displaystyle s=ek+c{\pmod {n}}\,} ( s {\displaystyle s\,} is the private...
any restrictions whatsoever. It is one of a few ciphers included in the OpenPGP standard (RFC 4880). However, Twofish has seen less widespread usage than...
means that f ⋅ f p = 1 ( mod p ) {\displaystyle \ {\textbf {f}}\cdot {\textbf {f}}_{p}=1{\pmod {p}}} and f ⋅ f q = 1 ( mod q ) {\displaystyle \ {\textbf...
distinct large primes, along with integers, e and d, such that e d ≡ 1 (mod φ(N)), where φ is Euler's totient function. The signer's public key consists...
{\displaystyle p} , g H ( m ) ≡ g x r + s k ( mod p ) ≡ ( g x ) r ( g k ) s ( mod p ) ≡ ( y ) r ( r ) s ( mod p ) . {\displaystyle {\begin{aligned}g^{H(m)}&\equiv...
2 mod n = 400 mod 77 = 15 {\displaystyle c=m^{2}{\bmod {n}}=400{\bmod {77}}=15} . Decryption proceeds as follows: Compute m p = c 1 4 ( p + 1 ) mod p...
Global Information
